Independent mistakes in large games
Ady Pauzner
International Journal of Game Theory, 2000, vol. 29, issue 2, 189-209
Abstract:
Economic models usually assume that agents play precise best responses to others' actions. It is sometimes argued that this is a good approximation when there are many agents in the game, because if their mistakes are independent, aggregate uncertainty is small. We study a class of games in which players' payoffs depend solely on their individual actions and on the aggregate of all players' actions. We investigate whether their equilibria are affected by mistakes when the number of players becomes large. Indeed, in generic games with continuous payoff functions, independent mistakes wash out in the limit. This may not be the case if payoffs are discontinuous. As a counter-example we present the n players Nash bargaining game, as well as a large class of "free-rider games."
Keywords: Large; games; ·; independent; mistakes; ·; trembles; ·; free; rider (search for similar items in EconPapers)
Date: 2000-07-12
Note: Received: November 1997/Final version: December 1999
References: Add references at CitEc
Citations:
Downloads: (external link)
http://link.springer.de/link/service/journals/00182/papers/0029002/00290189.pdf (application/pdf)
Access to the full text of the articles in this series is restricted
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jogath:v:29:y:2000:i:2:p:189-209
Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/182/PS2
Access Statistics for this article
International Journal of Game Theory is currently edited by Shmuel Zamir, Vijay Krishna and Bernhard von Stengel
More articles in International Journal of Game Theory from Springer, Game Theory Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().