2 citations · 2 across the 1 of their papers we have counts for
1 paper · 1 filter
Andreas Polyméris, Fabián Riquelme
We study the computational complexity of an important property of simple, regular and weighted games, which is decisiveness. We show that this concept can naturally be represented…