A characterization of the Shapley value in queueing problems

From MaRDI portal
Publication:1810697


DOI10.1016/S0022-0531(02)00036-4zbMath1032.91020MaRDI QIDQ1810697

François Maniquet

Publication date: 9 June 2003

Published in: Journal of Economic Theory (Search for Journal in Brave)


91A12: Cooperative games

90B22: Queues and service in operations research


Related Items

Coalitional games: monotonicity and core, Characterizing the Shapley value in fixed-route traveling salesman problems with appointments, On the number of blocks required to access the core, Balanced consistency and balanced cost reduction for sequencing problems, Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency, Consistency and monotonicity in sequencing problems, The truncated core for games with upper bounds, Axiomatizations of two types of Shapley values for games on union closed systems, Group strategyproofness in queueing models, Proportionate flow shop games, Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems, Children crying at birthday parties. Why?, Proportional scheduling, split-proofness, and merge-proofness, Sharing a river among satiable agents, On the coincidence of the prenucleolus and the Shapley value, Processing games with restricted capacities, Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines, Computer science and decision theory, Component efficient solutions in line-graph games with applications, Cost sharing in a job scheduling problem, Fairness and implementability in allocation of indivisible objects with monetary compensations, The optimistic \(TU\) game in minimum cost spanning tree problems, Cooperation in Markovian queueing models, No-envy in queueing problems, A pessimistic approach to the queueing problem



Cites Work