The Shapley value for shortest path games: a non-graph-based approach

DOI10.1007/S10100-012-0272-5zbMATH Open1339.91022OpenAlexW2006761955MaRDI QIDQ301134FDOQ301134

Authors: Miklós Pintér, Anna Radványi 

Publication date: 29 June 2016

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-012-0272-5

Recommendations

• On shortest path games
• Shortest path games
• Cost allocation in shortest path games
• On the nucleolus of shortest path games
• The Shapley value for directed graph games

zbMATH Keywords

Shapley valueTU gamesaxiomatizations of the Shapley valuemonotone gamesshortest path games

Mathematics Subject Classification ID

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

Cites Work

• Potential, Value, and Consistency
• Title not available (Why is that?)
• Monotonic solutions of cooperative games
• Introduction to the Theory of Cooperative Games
• Graphs and Cooperation in Games
• The Shapley value on some lattices of monotonic games
• A new axiomatization of the Shapley value
• On the uniqueness of the Shapley value
• An axiomatization of the Shapley value using a fairness property
• Null or nullifying players: the difference between the Shapley value and equal division solutions
• On shortest path games
• The Shapley Value as Aircraft Landing Fees–Revisited

Cited In (4)

• Editorial
• Editorial
• Shapley distance and Shapley index for some special graphs
• On shortest path games

This page was built for publication: The Shapley value for shortest path games: a non-graph-based approach

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