2019
DOI: 10.3390/g10020017
|View full text |Cite
|
Sign up to set email alerts
|

Routing-Proofness in Congestion-Prone Networks

Abstract: 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 dir… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 23 publications
0
1
0
Order By: Relevance
“…This property is in the line of other requirements that prevent manipulations in the routing. For example, Henriet and Moulin (1996) introduced a similar concept called no transit, and it has been more recently applied in other papers such as Moulin (2009) or Juarez and Wu (2019) under the name routing-proofness.…”
Section: Rules That Use Additional Informationmentioning
confidence: 99%
“…This property is in the line of other requirements that prevent manipulations in the routing. For example, Henriet and Moulin (1996) introduced a similar concept called no transit, and it has been more recently applied in other papers such as Moulin (2009) or Juarez and Wu (2019) under the name routing-proofness.…”
Section: Rules That Use Additional Informationmentioning
confidence: 99%