In this note we show that, for generic plurality games (i.e., voting games under plurality rule), an equilibrium that induces a mixed distribution over the outcomes (i.e., with two or more candidates elected with positive probability), is regular and, hence, a Mertens' stable set. Furthermore, we show that stronger equilibrium concepts, than stability, do not guarantee the existence of a solution for some generic plurality games. A final example shows the weakness of the simple sophisticated voting principle
This paper studies the dominance-solvability (by iterated deletion of weakly dominated strategies) o...
Understanding the nature of strategic voting is the holy grail of social choice theory, where game-t...
International audienceThis paper deals with the non-emptiness of the stability set for any proper vo...
In this paper we prove that for generic (noncooperative) voting games under plurality rule the set o...
In this paper, we prove that for generic (non cooperative) voting games under plurality rule an equi...
We prove two results on the generic determinacy of Nash equilibrium in voting games. The first one i...
We prove that for generic plurality games with positive cost of voting, the number of Nash equilibri...
We prove that for generic plurality games with positive cost of voting, the number of Nash equilibri...
We present a simple voting environment with three candidates where the Condorcet winner exists. Unde...
We prove two results on the generic determinacy of Nash equilibrium in voting games. The first one i...
In this note we discuss two examples of appoval voting games. The first one, with six voters and thr...
Abstract. We study a game-theoretic model for Plurality, one of the most well-studied and widely-use...
Voting is widely used to aggregate the different preferences of agents, even though these agents are...
In this paper, we look at the effects of voter coordination on the equilibrium of voting games. Spe...
Abstract. This paper deals with the non-emptiness of the stability set for any proper voting game. W...
This paper studies the dominance-solvability (by iterated deletion of weakly dominated strategies) o...
Understanding the nature of strategic voting is the holy grail of social choice theory, where game-t...
International audienceThis paper deals with the non-emptiness of the stability set for any proper vo...
In this paper we prove that for generic (noncooperative) voting games under plurality rule the set o...
In this paper, we prove that for generic (non cooperative) voting games under plurality rule an equi...
We prove two results on the generic determinacy of Nash equilibrium in voting games. The first one i...
We prove that for generic plurality games with positive cost of voting, the number of Nash equilibri...
We prove that for generic plurality games with positive cost of voting, the number of Nash equilibri...
We present a simple voting environment with three candidates where the Condorcet winner exists. Unde...
We prove two results on the generic determinacy of Nash equilibrium in voting games. The first one i...
In this note we discuss two examples of appoval voting games. The first one, with six voters and thr...
Abstract. We study a game-theoretic model for Plurality, one of the most well-studied and widely-use...
Voting is widely used to aggregate the different preferences of agents, even though these agents are...
In this paper, we look at the effects of voter coordination on the equilibrium of voting games. Spe...
Abstract. This paper deals with the non-emptiness of the stability set for any proper voting game. W...
This paper studies the dominance-solvability (by iterated deletion of weakly dominated strategies) o...
Understanding the nature of strategic voting is the holy grail of social choice theory, where game-t...
International audienceThis paper deals with the non-emptiness of the stability set for any proper vo...