Routing-proofness in congestion-prone networks

DOI10.3390/G10020017MaRDI QIDQ2183993zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 27 May 2020

Published in Games (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• Pricing traffic in a spanning network
• Sharing the cost of a capacity network
• Implementing efficient graphs in connection networks
• Optimal cost-sharing in weighted congestion games
• Public congestion network situations and related games

Cites work

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

Cited in

(7)

• Detecting and preventing routing problems in the planning process of CCSS\#7 networks
• On how to allocate the fixed cost of transport systems
• Implementing efficient graphs in connection networks
• UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS
• scientific article; zbMATH DE number 6851840 (Why is no real title available?)
• Pricing traffic in a spanning network
• scientific article; zbMATH DE number 1775423 (Why is no real title available?)

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)