The Shapley value in positional queueing problems

DOI10.1007/S00182-024-00901-7MaRDI QIDQ6665435zbMATH OpenFDO

Authors Changyong Han, Youngsub Chun

Publication date 17 January 2025

Published in International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00182-024-00901-7

zbMATH Keywords

Shapley valueaxiomatic characterizationsoptimistic Shapley rulepessimistic Shapley rulepositional queueing problems

Mathematics Subject Classification ID

Game theory (91Axx)

Recommendations

• A characterization of the Shapley value in queueing problems
• A pessimistic approach to the queueing problem
• Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
• Recent developments in the queueing problem
• Consistent queueing rules

Cites work

• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• A characterization of the Shapley value in queueing problems
• A pessimistic approach to the queueing problem
• Achieving the first best in sequencing problems.
• Allocating positions fairly: auctions and Shapley value
• Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
• Cycle monotonicity in scheduling models
• Fair queueing
• Group strategyproofness in queueing models
• Mechanism design in queueing problems
• On the coincidence of the prenucleolus and the Shapley value
• The Nucleolus of a Characteristic Function Game
• Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines

Cited in

(2)

• The on-line transfer rule for queueing with arrivals
• Consistent queueing rules

This page was built for publication: The Shapley value in positional queueing problems

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