Abstract

We consider a class of social dilemmas in which groups of size n are asked to share a common resource pool whose exact size, x, is not known. Rather, x is sampled randomly from a probability distribution which is common knowledge. Each group member requests a share of the common pool; requests are made sequentially with complete information about the preceding requests. Individual requests are granted if and only if the total group request is equal to or smaller than x. Experimental data show significant and consistent effects due to the player's position in the sequence and the amount of uncertainty about x. The results are used to test competitively two models—a subgame perfect equilibrium solution grounded in the logic of game theory and a modified equal share model based on the notion of focal points. On the average, the modified equal share model outperforms the equilibrium model in predicting the players' requests. Additional tests of the two models are proposed.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.