A non-cooperative game theory approach to cost sharing in networks

DOI10.1007/s00186-021-00754-wzbMath1482.91007OpenAlexW3210862190MaRDI QIDQ2067258

Yanyan Li

Publication date: 18 January 2022

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-021-00754-w

zbMATH Keywords

Nash equilibriumcapacity synthesis problemnon-cooperative network game

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43)

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A non-cooperative approach to the cost spanning tree problem.
• On the core of network synthesis games
• Characterization of monotonic rules in minimum cost spanning tree problems
• Sharing a minimal cost spanning tree: beyond the folk solution
• Opportune moment strategies for a cost spanning tree game
• The degree and cost adjusted folk solution for minimum cost spanning tree games
• On the set of extreme core allocations for minimal cost spanning tree problems
• COST SHARING IN NETWORKS: SOME OPEN QUESTIONS
• Sharing the Cost of a Capacity Network
• On the core and nucleolus of minimum cost spanning tree games
• Inefficiency of Nash Equilibria
• On cost allocation for a spanning tree: A game theoretic approach
• Spanning Trees and Optimization Problems

This page was built for publication: A non-cooperative game theory approach to cost sharing in networks