Poisson games

In game theory a Poisson game is a game with a random number of players, where the distribution of the number of players follows a Poisson random process.^[1] An extension of games of imperfect information, Poisson games have mostly seen application to models of voting.

A Poisson games consists of a random population of possible players of various types. Every player in the game has some probability of being of some type. The type of the player affects their payoffs in the game. Each type chooses an action and payoffs are determined.

Example[]

Formal definitions[]

Large Poisson game - the collection $(n,T,r,C,u)$ , where:
$n$ - the average number of players in the game
$T$ - the set of all possible types for a player, (same for each player).
$r$ - the probability distribution over $T$ according to which the types are selected.
$C$ - the set of all possible pure choices, (same for each player, same for each type).
$u$ - the payoff (utility) function.

The total number of players, $N$ is a poisson distributed random variable:
$P(N=k)=e^{-n}{\frac {n^{k}}{k!}}$

Strategy -

Nash equilibrium -

Simple probabilistic properties[]

Environmental equivalence - from the perspective of each player the number of other players is a Poisson random variable with mean $n$ .

Decomposition property for types - the number of players of the type $t$ is a Poisson random variable with mean $nr(t)$ .

Decomposition property for choices - the number of players who have chosen the choice $c$ is a Poisson random variable with mean $...$

Pivotal probability ordering Every limit of the form $\lim _{n\to \infty }{\frac {P}{P}}$ is equal to 0 or to infinity. This means that all pivotal probability may be ordered from the most important to the least important.

Magnitude $2({\sqrt {xy}}-{\frac {x+y}{2}})$ . This has a nice form: twice geometric mean minus arithmetic mean.

Existence of equilibrium[]

Theorem 1. Nash equilibrium exists.

Theorem 2. Nash equilibrium in undominated strategies exists.

Applications[]

Mainly large poisson games are used as models for voting procedures.

References[]

^ Myerson, Roger (1998). "Population Uncertainty and Poisson games". International Journal of Game Theory. 27 (27): 375–392. CiteSeerX 10.1.1.21.9555. doi:10.1007/s001820050079.

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.

[1] Myerson, Roger (1998). "Population Uncertainty and Poisson games". International Journal of Game Theory. 27 (27): 375–392. CiteSeerX 10.1.1.21.9555. doi:10.1007/s001820050079.

[1]

v t Topics in game theory
Definitions	Congestion game Cooperative game Determinacy Escalation of commitment Extensive-form game First-player and second-player win Game complexity Game description language Graphical game Hierarchy of beliefs Information set Normal-form game Preference Sequential game Simultaneous game Simultaneous action selection Solved game Succinct game
Equilibrium concepts	Bayesian Nash equilibrium Berge equilibrium Core Correlated equilibrium Epsilon-equilibrium Evolutionarily stable strategy Gibbs equilibrium Mertens-stable equilibrium Markov perfect equilibrium Nash equilibrium Pareto efficiency Perfect Bayesian equilibrium Proper equilibrium Perfect Bayesian 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
Strategies	Dominant strategies Pure strategy Mixed strategy Strategy-stealing argument Tit for tat Grim trigger Collusion Backward induction Forward induction Markov strategy Bid shading
Classes of games	Bargaining problem Cheap talk Global game Intransitive game Mean-field game Mechanism design n-player game Perfect information Large Poisson game Potential game Repeated game Screening game Signaling game Stackelberg competition Strictly determined game Stochastic game Symmetric game Zero-sum game
Games	Go Chess Infinite chess Checkers Tic-tac-toe 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 Rock paper scissors Pirate game Dictator game Public goods game Blotto game War of attrition El Farol Bar problem Fair division Fair cake-cutting Cournot game 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
Theorems	Arrow's impossibility theorem Aumann's agreement theorem Folk theorem Minimax theorem Nash's theorem Purification theorem Revelation principle Zermelo's theorem
Key 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
Miscellaneous	All-pay auction Alpha–beta pruning Bertrand paradox Bounded rationality Combinatorial game theory Confrontation analysis Coopetition Evolutionary game theory First-move advantage in chess Game Description Language Game mechanics Glossary of game theory List of game theorists List of games in game theory No-win situation Solving chess Topological game Tragedy of the commons Tyranny of small decisions