Poisson game
In game theory and political science, Poisson games are a class of games often used to model the behavior of large populations. One common application is determining the strategic behavior of voters with imperfect information about each others' preferences.[1] Poisson games are most often used to model strategic voting in large electorates with secret and simultaneous voting.
A Poisson game consists of a random population of players of various types, the size of which follow a Poisson distribution. This can occur when voters are not sure what the relative turnout of each party will be, or when they have imperfect polling information. For example, a model of the 1992 United States presidential election might include 4 types of voters: Democrats, Republicans, and two classes of Reform voters (those with second preferences of either Bill Clinton or George H.W. Bush).
Main assumptions
The first assumption of the model is that the total number of players of each type follows a Poisson distribution. In other words, the probability of voters turning out to support a given candidate is given by:
More important is the assumption that voters are only interested in securing the best possible election outcome for themselves, and are motivated only by the possibility of casting the deciding vote. In other words, voters are assumed not to care about expressing their true opinions; about showing support for a minor party, even if they do not win; or about allowing other voters' voices to be heard. All of these effects tend to produce more honest voting in real elections than would be found in the Poisson model.
In the model, all information is publicly-available, meaning that every voter can estimate the probability that each pair of candidates will be tied. An example of this would be an election with public opinion polling.
Results
The Poisson voting model generates several key results.
Approval and score
Under the Poisson model, approval voting and score voting behave identically, as each voter's best strategy involves casting a ballot that assigns every candidate either the maximum or minimum score.
Plurality
Under plurality, sincere voting is never a stable equilibrium with more than two candidates, i.e. many voters are incentivized to lie about their favorite candidate and vote for the lesser of two evils.[1] For example, in the 2016 United States presidential election, some polls suggest that Gary Johnson was the majority-preferred winner. However, Johnson ultimately received only a small fraction of the vote because voters expected him to lose, creating a self-fulfilling prophecy.[2]
See also
References
- ^ a b Myerson, Roger (1998). "Population Uncertainty and Poisson games". International Journal of Game Theory. 27 (3): 375–392. CiteSeerX 10.1.1.21.9555. doi:10.1007/s001820050079.
- ^ Potthoff, Richard F.; Munger, Michael C. (November 2021). "Condorcet Loser in 2016: Apparently Trump; Condorcet Winner: Not Clinton?". American Politics Research. 49 (6): 618–636. doi:10.1177/1532673X211009499. ISSN 1532-673X.
- Myerson, Roger B. (2000). "Large Poisson Games". Journal of Economic Theory. 94 (1): 7–45. doi:10.1006/jeth.1998.2453.
- Myerson, Roger B. (1998). "Population Uncertainty and Poisson Games". International Journal of Game Theory. 27 (3): 375–392. CiteSeerX 10.1.1.21.9555. doi:10.1007/s001820050079.
- De Sinopoli, Francesco; Pimienta, Carlos G. (2009). "Undominated (and) perfect equilibria in Poisson games". Games and Economic Behavior. 66 (2): 775–784. CiteSeerX 10.1.1.549.9282. doi:10.1016/j.geb.2008.09.029.
- v
- t
- e
- Congestion game
- Cooperative game
- Determinacy
- Escalation of commitment
- Extensive-form game
- First-player and second-player win
- Game complexity
- Graphical game
- Hierarchy of beliefs
- Information set
- Normal-form game
- Preference
- Sequential game
- Simultaneous game
- Simultaneous action selection
- Solved game
- Succinct game
- Mechanism design
concepts
- Bayes correlated equilibrium
- Bayesian Nash equilibrium
- Berge equilibrium
- Core
- Correlated equilibrium
- Coalition-proof Nash equilibrium
- Epsilon-equilibrium
- Evolutionarily stable strategy
- Gibbs equilibrium
- Mertens-stable equilibrium
- Markov perfect equilibrium
- Nash equilibrium
- Pareto efficiency
- Perfect Bayesian equilibrium
- Proper equilibrium
- Quantal response equilibrium
- Quasi-perfect equilibrium
- Risk dominance
- Satisfaction equilibrium
- Self-confirming equilibrium
- Sequential equilibrium
- Shapley value
- Strong Nash equilibrium
- Subgame perfection
- Trembling hand equilibrium
of games
- Go
- Chess
- Infinite chess
- Checkers
- All-pay auction
- Prisoner's dilemma
- Gift-exchange game
- Optional prisoner's dilemma
- Traveler's dilemma
- Coordination game
- Chicken
- Centipede game
- Lewis signaling game
- Volunteer's dilemma
- Dollar auction
- Battle of the sexes
- Stag hunt
- Matching pennies
- Ultimatum game
- Electronic mail game
- Rock paper scissors
- Pirate game
- Dictator game
- Public goods game
- Blotto game
- War of attrition
- El Farol Bar problem
- Fair division
- Fair cake-cutting
- Bertrand competition
- Cournot competition
- Stackelberg competition
- Deadlock
- Diner's dilemma
- Guess 2/3 of the average
- Kuhn poker
- Nash bargaining game
- Induction puzzles
- Trust game
- Princess and monster game
- Rendezvous problem
- Aumann's agreement theorem
- Folk theorem
- Minimax theorem
- Nash's theorem
- Negamax theorem
- Purification theorem
- Revelation principle
- Sprague–Grundy theorem
- Zermelo's theorem
figures
- Albert W. Tucker
- Amos Tversky
- Antoine Augustin Cournot
- Ariel Rubinstein
- Claude Shannon
- Daniel Kahneman
- David K. Levine
- David M. Kreps
- Donald B. Gillies
- Drew Fudenberg
- Eric Maskin
- Harold W. Kuhn
- Herbert Simon
- Hervé Moulin
- John Conway
- Jean Tirole
- Jean-François Mertens
- Jennifer Tour Chayes
- John Harsanyi
- John Maynard Smith
- John Nash
- John von Neumann
- Kenneth Arrow
- Kenneth Binmore
- Leonid Hurwicz
- Lloyd Shapley
- Melvin Dresher
- Merrill M. Flood
- Olga Bondareva
- Oskar Morgenstern
- Paul Milgrom
- Peyton Young
- Reinhard Selten
- Robert Axelrod
- Robert Aumann
- Robert B. Wilson
- Roger Myerson
- Samuel Bowles
- Suzanne Scotchmer
- Thomas Schelling
- William Vickrey
![]() | This game theory article is a stub. You can help Wikipedia by expanding it. |
- v
- t
- e