Next Article in Journal
Behavior in Strategic Settings: Evidence from a Million Rock-Paper-Scissors Games
Previous Article in Journal
Investigating Peer and Sorting Effects within an Adaptive Multiplex Network Model
Article

Routing-Proofness in Congestion-Prone Networks

Department of Economics, University of Hawaii, 2424 Maile Way, Saunders Hall 542, Honolulu, HI 96822, USA
*
Author to whom correspondence should be addressed.
Games 2019, 10(2), 17; https://doi.org/10.3390/g10020017
Received: 31 December 2018 / Revised: 8 March 2019 / Accepted: 25 March 2019 / Published: 3 April 2019
(This article belongs to the Special Issue Cooperative OR Games and Networks)
We consider the problem of sharing the cost of connecting a large number of atomless agents in a network. The centralized agency elicits the target nodes that agents want to connect, and charges agents based on their demands. We look for a cost-sharing mechanism that satisfies three desirable properties: efficiency which charges agents based on the minimum total cost of connecting them in a network, stand-alone core stability which requires charging agents not more than the cost of connecting by themselves directly, and limit routing-proofness which prevents agents from profitable reporting as several agents connecting from A to C to B instead of A to B. We show that these three properties are not always compatible for any set of cost functions and demands. However, when these properties are compatible, a new egalitarian mechanism is shown to satisfy them. When the properties are not compatible, we find a rule that meets stand-alone core stability, limit routing-proofness and minimizes the budget deficit. View Full-Text
Keywords: cost sharing; core stability; routing proofness cost sharing; core stability; routing proofness
Show Figures

Figure 1

MDPI and ACS Style

Juarez, R.; Wu, M. Routing-Proofness in Congestion-Prone Networks. Games 2019, 10, 17. https://doi.org/10.3390/g10020017

AMA Style

Juarez R, Wu M. Routing-Proofness in Congestion-Prone Networks. Games. 2019; 10(2):17. https://doi.org/10.3390/g10020017

Chicago/Turabian Style

Juarez, Ruben, and Michael Wu. 2019. "Routing-Proofness in Congestion-Prone Networks" Games 10, no. 2: 17. https://doi.org/10.3390/g10020017

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop