Large Poisson Games
Existence of equilibria is proven for Poisson games with compact type sets and finite action sets. Then three theorems are introduced for characterizing limits of probabilities in Poisson games when the expected number of players becomes large. The magnitude theorem characterizes the rate at which probabilities of events go zero. The offset theorem characterizes the ratios of probabilites of events that differ by a finite additive translation. The hyperplane theorem estimates probabilites of hyperplane events. These theorems are applied to derive formulas for pivot probabilities in binary elections, and to analyze a voting game that was studied by Ledyard.
(This abstract was borrowed from another version of this item.)
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Roger B. Myerson, 1994.
"Population Uncertainty and Poisson Games,"
1102, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Igal Milchtaich, 1997. "Random-Player Games," Discussion Papers 1178, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Paul Milgrom & Robert Weber, 1981. "Distributional Strategies for Games with Incomplete Information," Discussion Papers 428R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:94:y:2000:i:1:p:7-45. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.