Competing for congestible goods: experimental evidence on parking choice.


Journal

Scientific reports
ISSN: 2045-2322
Titre abrégé: Sci Rep
Pays: England
ID NLM: 101563288

Informations de publication

Date de publication:
30 11 2020
Historique:
received: 09 09 2020
accepted: 02 11 2020
entrez: 1 12 2020
pubmed: 2 12 2020
medline: 2 12 2020
Statut: epublish

Résumé

Congestible goods describe situations in which a group of people share or use a public good that becomes congested or overexploited when demand is low. We study experimentally a congestible goods problem of relevance for parking design, namely how people choose between a convenient parking lot with few spots and a less convenient one with unlimited space. We find that the Nash equilibrium predicts reasonably well the competition for the convenient parking when it has few spots, but not when it has more availability. We then show that the Rosenthal equilibrium, a bounded-rational approach, is a better description of the experimental results accounting for the randomness in the decision process. We introduce a dynamical model that shows how Rosenthal equilibria can be approached in a few rounds of the game. Our results give insights on how to deal with parking problems such as the design of parking lots in central locations in cities and open the way to better understand similar congestible goods problems in other contexts.

Identifiants

pubmed: 33257701
doi: 10.1038/s41598-020-77711-w
pii: 10.1038/s41598-020-77711-w
pmc: PMC7705686
doi:

Types de publication

Journal Article Research Support, Non-U.S. Gov't

Langues

eng

Sous-ensembles de citation

IM

Pagination

20803

Références

Sci Rep. 2015 Jan 19;5:7843
pubmed: 25598347
PLoS Comput Biol. 2016 Jul 20;12(7):e1005034
pubmed: 27438888
J R Soc Interface. 2014 Feb 19;11(94):20131186
pubmed: 24554577
PLoS One. 2017 Dec 8;12(12):e0189220
pubmed: 29220413
Proc Natl Acad Sci U S A. 2002 May 14;99 Suppl 3:7229-36
pubmed: 12011402
Science. 1968 Dec 13;162(3859):1243-8
pubmed: 5699198

Auteurs

María Pereda (M)

Grupo de Investigación Ingeniería de Organización y Logística (IOL), Departamento Ingeniería de Organización, Administración de empresas y Estadística, Escuela Técnica Superior de Ingenieros Industriales, Universidad Politécnica de Madrid, C/ José Gutiérrez Abascal, 2, 28006, Madrid, Spain. mariaperedagarcia@gmail.com.
Unidad Mixta Interdisciplinar de Comportamiento y Complejidad Social (UMICCS) UC3M-UV-UZ, 28911, Leganés, Madrid, Spain. mariaperedagarcia@gmail.com.

Juan Ozaita (J)

Unidad Mixta Interdisciplinar de Comportamiento y Complejidad Social (UMICCS) UC3M-UV-UZ, 28911, Leganés, Madrid, Spain.
Grupo Interdisciplinar de Sistemas Complejos, Departamento de Matemáticas, Universidad Carlos III de Madrid, 28911, Leganés, Madrid, Spain.

Ioannis Stavrakakis (I)

Department of Informatics and Telecommunications, National and Kapodistrian University of Athens, Athens, Greece.

Angel Sánchez (A)

Unidad Mixta Interdisciplinar de Comportamiento y Complejidad Social (UMICCS) UC3M-UV-UZ, 28911, Leganés, Madrid, Spain.
Grupo Interdisciplinar de Sistemas Complejos, Departamento de Matemáticas, Universidad Carlos III de Madrid, 28911, Leganés, Madrid, Spain.
Institute UC3M-Santander for Big Data (IBiDat), Universidad Carlos III de Madrid, 28903, Getafe, Madrid, Spain.
Instituto de Biocomputación y Física de Sistemas Complejos (BIFI), Universidad de Zaragoza, 50018, Zaragoza, Spain.

Classifications MeSH