Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Hoefer (2010)
Strategic cooperation in cost sharing gamesInternational Journal of Game Theory, 42
Gerardo Berbeglia, J. Cordeau, G. Laporte (2010)
Dynamic pickup and delivery problemsEur. J. Oper. Res., 202
D. Acemoglu, A. Makhdoumi, Azarakhsh Malekian, A. Ozdaglar (2016)
Informational Braess' Paradox: The Effect of Information on Traffic CongestionOper. Res., 66
H. Rubin, S. Samuels (1977)
The Finite-Memory Secretary ProblemAnnals of Probability, 5
Ido Erev, A. Rapoport (1998)
Coordination, “Magic,” and Reinforcement Learning in a Market Entry GameGames and Economic Behavior, 23
J. Huyck, R. Battalio, Richard Beil (1991)
Strategic Uncertainty, Equilibrium Selection, and Coordination Failure in Average Opinion GamesQuarterly Journal of Economics, 106
H. Young (1985)
Producer Incentives in Cost AllocationEconometrica, 53
Vasilis Syrgkanis (2010)
Lecture Notes in Computer Science
A Rapoport, T Kugler, S Dugar, E Gishces (2009)
Choice of routes in congested traffic networks: Experimental tests of the Braess paradoxGames and Economic Behavior, 65
Ho-Lin Chen, T. Roughgarden, G. Valiant (2010)
Designing Network Protocols for Good EquilibriaSIAM J. Comput., 39
J. Morgan, H. Orzen, Martin Sefton (2007)
Network architecture and traffic flows: Experiments on the Pigou-Knight-Downs and Braess ParadoxesGames Econ. Behav., 66
Arnab Chakraborty (1996)
The secretary problemResonance, 1
Y. Chow, S. Moriguti, H. Robbins, S. Samuels (1964)
Optimal selection based on relative rank (the “secretary problem”)Israel Journal of Mathematics, 2
Vincent Mak, R. Zwick, A. Rao, Jake Pattaratanakun (2015)
"Pay What You Want" as Threshold Public Good ProvisionOrganizational Behavior and Human Decision Processes, 127
K. Jain, Mohammad Mahdian (2007)
Algorithmic Game Theory: Cost Sharing
(2008)
ride-sharing: A review
E Anshelevitch, A Dasgupta, J Kleinberg, É Tardos, T Wexler, T Roughgarden (2008)
The price of stability for network design with fair cost allocationSIAM Journal of Computing, 38
J. Huyck, R. Battalio, Richard Beil (1990)
Tacit Coordination Games, Strategic Uncertainty, and Coordination FailureThe American Economic Review, 80
A. Rapoport, Eyran Gisches, Vincent Mak (2014)
Distributed Decisions in Networks: Laboratory Study of Routing Splittable FlowProduction and Operations Management, 23
J. Goeree, Charles Holt (2005)
An experimental study of costly coordinationGames Econ. Behav., 51
H. Moulin (2002)
The proportional random allocation of indivisible unitsSocial Choice and Welfare, 19
Masabumi Furuhata, M. Dessouky, F. Ordóñez, Marc-Etienne Brunet, Xiaoqing Wang, Sven Koenig (2013)
Ridesharing : The state-ofthe-art and future directions
I Arieli, RJ Aumann (2015)
The logic of backward inductionJournal of Economic Theory, 159
T. Ferguson (1989)
Who Solved the Secretary ProblemStatistical Science, 4
(2012)
Optimization for dynamic ridesharing : A review
A. Rapoport, Vincent Mak, R. Zwick (2006)
Navigating congested networks with variable demand: Experimental evidenceJournal of Economic Psychology, 27
K Jain, M Mahdian (2007)
Algorithmic game theory
Vasilis Syrgkanis (2010)
The Complexity of Equilibria in Cost Sharing Games
A. Rapoport, Tamar Kugler, Subhasish Dugar, Eyran Gisches (2005)
Choice of Routes in Congested Traffic Networks: Experimental Tests of the Braess ParadoxMicroeconomic Theory eJournal
A. Rapoport, T. Schelling (1961)
The Strategy of Conflict.Journal of the American Statistical Association, 56
Roy Chen, Yan Chen (2011)
The Potential of Social Identity for Equilibrium SelectionThe American Economic Review, 101
Eyran Gisches, A. Rapoport (2010)
Degrading network capacity may improve performance: information effects in the Braess Paradox
B. Ghosh, P. Sen (1991)
Handbook of sequential analysis
V. Crawford (1995)
Adaptive dynamics in coordination gamesEconometrica, 63
M Shubik (1982)
Game theory in the social sciences
Elliot Anshelevich, Anirban Dasgupta, J. Kleinberg, É. Tardos, T. Wexler, T. Roughgarden (2004)
The price of stability for network design with fair cost allocation45th Annual IEEE Symposium on Foundations of Computer Science
G. Charness, Francesco Feri, Miguel Meléndez-Jiménez, Matthias Sutter (2014)
Experimental Games on Networks: Underpinnings of Behavior and Equilibrium SelectionMicroeconomics: Search; Learning; Information Costs & Specific Knowledge; Expectation & Speculation eJournal
Mordecai Kurz (1986)
Game Theory in the Social Sciences. Vol. 1, Concepts and Solutions. Vol. 2, A Game-theoretic Approach to Political Economy. Martin ShubikJournal of Political Economy, 94
H. Young (1998)
Cost allocation, demand revelation, and core implementationMathematical Social Sciences, 36
Itai Arieli, R. Aumann (2012)
The Logic of Backward InductionGame Theory & Bargaining Theory eJournal
Darryl Seale, A. Rapoport (2000)
Elicitation of Strategy Profiles in Large Group Coordination GamesExperimental Economics, 3
A. Geller, R. Schmidgall (1980)
Cost AllocationCornell Hotel and Restaurant Administration Quarterly, 21
E. Platen (1980)
About secretary problemsBanach Center Publications, 6
R. Selten, T. Chmura, Thomas Pitz, Sebastian Kube, M. Schreckenberg (2007)
Commuters route choice behaviourGames Econ. Behav., 58
Caiyun Liu, Vincent Mak, Amnon Rapoport (2015)
Cost-sharing in directed networks: experimental study of equilibrium choice and system dynamicsJournal of Operations Management, 39
Within the last decade, there has been a dramatic bloom in ridesharing businesses along with the emergence of new enabling technologies. A central issue in ridesharing, which is also important in the general domain of cost-sharing in economics and computer science, is that the sharing of cost implies positive externalities and hence coordination problems for the network users. We investigate these problems experimentally in the present study. In particular, we focus on how sequential observability of transportation mode choices can be a powerful facilitator of coordination in ridesharing. Our study abstracts the essential issues of coordination in ridesharing into a directed network game with experimentally testable predictions. In line with the theoretical analysis, our experimental evidence shows that even a limited extent of sequential choice observability might lead to efficient coordination. However, convergence to efficiency is slower with more limited observability, resulting in a significant increase in travel cost.
Theory and Decision – Springer Journals
Published: May 30, 2018
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.