Routing-proofness in congestion-prone networks

DOI10.3390/G10020017zbMATH Open1443.91025OpenAlexW2925937923MaRDI QIDQ2183993FDOQ2183993

Yanyan Li

Publication date: 27 May 2020

Published in: Games (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/g10020017

zbMATH Keywords

cost sharingcore stabilityrouting proofness

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Cites Work

• The price of anarchy is independent of the network topology
• Highway toll pricing
• An Introduction to Allocation Rules
• Truth-telling and Nash equilibria in minimum cost spanning tree models
• Sharing the Cost of a Capacity Network
• Equal-need sharing of a network under connectivity constraints
• Minimum cost arborescences
• The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule
• Group strategyproof cost sharing: the role of indifferences
• Implementing efficient graphs in connection networks
• Secure implementation in production economies
• Cost sharing in networks: some open questions
• Sharing the proceeds from a hierarchical venture
• Cost-Balancing Tolls for Atomic Network Congestion Games
• Sharing sequential values in a network
• Pricing traffic in a spanning network
• Minimum cost connection networks: truth-telling and implementation
• Free intermediation in resource transmission

Cited In (5)

• On how to allocate the fixed cost of transport systems
• Title not available (Why is that?)
• UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS
• Detecting and preventing routing problems in the planning process of CCSS\#7 networks
• Title not available (Why is that?)

This page was built for publication: Routing-proofness in congestion-prone networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2183993)