Complexity of Networking - An Experimental Study of the Network Hawk Dove Game
AbstractComplexity of strategies is central for human decision making and attracted interest of different game theorists in the recent years. Nevertheless, behavioral economists have neglected the importance of complexity in their analyses. In this paper, we analyze network formation and action selection in a Hawk Dove Game with focus on complexity aspects. We conduct experiments with three variants of the game which are equivalent from a game theoretic perspective, but differ from a complexity theoretic perspective. Our results show, that complexity of decision making has an impact on the strategies played and that efficiency is higher the less complex the decision problem is.
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.
Bibliographic InfoPaper provided by Otto-von-Guericke University Magdeburg, Faculty of Economics and Management in its series FEMM Working Papers with number 110024.
Length: 21 pages
Date of creation: Nov 2011
Date of revision:
Contact details of provider:
Postal: Universitätsplatz 2, Gebäude W und I, 39106 Magdeburg
Phone: (0391) 67-18 584
Fax: (0391) 67-12 120
Web page: http://www.ww.uni-magdeburg.de
More information through EDIRC
This paper has been announced in the following NEP Reports:
- NEP-ALL-2011-12-13 (All new papers)
- NEP-CBE-2011-12-13 (Cognitive & Behavioural Economics)
- NEP-EXP-2011-12-13 (Experimental Economics)
- NEP-GTH-2011-12-13 (Game Theory)
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.:
- Ehud Kalai & William Stanford, 1986.
"Finite Rationality and Interpersonal Complexity in Repeated Games,"
679, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March.
- Yann Bramoullé & Dunia López-Pintado & Sanjeev Goyal & Fernando Vega-Redondo, 2004.
"Network formation and anti-coordination games,"
International Journal of Game Theory,
Springer, vol. 33(1), pages 1-19, January.
- Pingle, Mark, 1992. "Costly optimization: an experiment," Journal of Economic Behavior & Organization, Elsevier, vol. 17(1), pages 3-30, January.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- Boris van Leeuwen & Theo Offerman & Arthur Schram, 2013. "Superstars Need Social Benefits: An Experiment on Network Formation," Tinbergen Institute Discussion Papers 13-112/I, Tinbergen Institute.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guido Henkel).
If references are entirely missing, you can add them using this form.