Crowding games are sequentially solvable
AbstractA sequential-move version of a given normal-form game is an extensive-form game of perfect information in which each player chooses his action after observing the actions of all players who precede him and the payoffs are determined according to the payoff functions in . A normal-form game is sequentially solvable if each of its sequential-move versions has a subgame-perfect equilibrium in pure strategies such that the players' actions on the equilibrium path constitute an equilibrium of . A crowding game is a normal-form game in which the players share a common set of actions and the payoff a particular player receives for choosing a particular action is a nonincreasing function of the total number of players choosing that action. It is shown that every crowding game is sequentially solvable. However, not every pure-strategy equilibrium of a crowding game can be obtained in the manner described above. A sufficient, but not necessary, condition for the existence of a sequential-move version of the game that yields a given equilibrium is that there is no other equilibrium that Pareto dominates it.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Springer in its journal International Journal of Game Theory.
Volume (Year): 27 (1998)
Issue (Month): 4 ()
Note: Received July 1997/Final version May 1998
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00182/index.htm
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Andelman, Nir & Feldman, Michal & Mansour, Yishay, 2009. "Strong price of anarchy," Games and Economic Behavior, Elsevier, vol. 65(2), pages 289-317, March.
- Milchtaich, Igal & Winter, Eyal, 2002.
"Stability and Segregation in Group Formation,"
Games and Economic Behavior,
Elsevier, vol. 38(2), pages 318-346, February.
- Renault, Jérôme & Scarlatti, Sergio & Scarsini, Marco, 2008.
"Discounted and finitely repeated minority games with public signals,"
Mathematical Social Sciences,
Elsevier, vol. 56(1), pages 44-74, July.
- Scarlatti, Sergio & Scarsini, Marco & Renault, Jérôme, 2008. "Discounted and Finitely Repeated Minority Games with Public Signals," Open Access publications from UniversitÃ© Paris-Dauphine urn:hdl:123456789/2347, Université Paris-Dauphine.
- Renault, Jérôme & Scarlatti, Sergio & Scarsini, Marco, 2008. "Discounted and finitely repeated minority games with public signals," Open Access publications from University of Toulouse 1 Capitole http://neeo.univ-tlse1.fr, University of Toulouse 1 Capitole.
- Darryl Seale & Amnon Rapoport, 2000. "Elicitation of Strategy Profiles in Large Group Coordination Games," Experimental Economics, Springer, vol. 3(2), pages 153-179, October.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.