A characterization of the Shapley value in queueing problems

DOI10.1016/S0022-0531(02)00036-4zbMATH Open1032.91020MaRDI QIDQ1810697FDOQ1810697

Authors: François Maniquet 

Publication date: 9 June 2003

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

Recommendations

• A pessimistic approach to the queueing problem
• On the coincidence of the prenucleolus and the Shapley value
• Recent developments in the queueing problem
• Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
• A new axiomatization of the Shapley value

zbMATH Keywords

Shapley valueequal responsibilityImpatience independenceQueueing problems

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Cooperative games (91A12)

Cites Work

• Refinements of the no-envy solution in economies with indivisible goods
• On weighted Shapley values
• Title not available (Why is that?)
• No-Envy and Consistency in Economies with Indivisible Goods
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• The Fair Division of a Fixed Supply Among a Growing Population
• On monotonicity in economies with indivisible goods
• Fair Allocation of Indivisible Goods and Criteria of Justice
• Trade-off between equity and efficiency in a general economy with indivisible goods
• Welfare bounds in the fair division problem
• The fair allocation of an indivisible good when monetary compensations are possible
• Welfare-domination under preference-replacement: a survey and open questions
• An Application of the Shapley Value to Fair Division with Money
• Equality of Resources Implies Equality of Welfare
• The Pure Compensation Problem: Egalitarianism Versus Laissez-Fairism

Cited In (73)

• Cooperation in Markovian queueing models
• Egalitarian equivalence and strategyproofness in the queueing problem
• A characterization of the symmetrically balanced VCG rule in the queueing problem
• Auctioning and selling positions: a non-cooperative approach to queueing conflicts
• Balanced consistency and balanced cost reduction for sequencing problems
• Switching queues, cultural conventions, and social welfare
• Axiomatic characterizations under players nullification
• Coalitional games: monotonicity and core
• The average tree permission value for games with a permission tree
• The truncated core for games with upper bounds
• From hierarchies to levels: new solutions for games with hierarchical structure
• Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency
• Cost allocation in rescheduling with machine unavailable period
• Games with a local permission structure: separation of authority and value generation
• Subgroup additivity in the queueing problem
• No-envy, solidarity, and strategy-proofness in the queueing problem
• Consistency and monotonicity in sequencing problems
• Group strategyproofness in queueing models
• Proportional scheduling, split-proofness, and merge-proofness
• Sharing a river among satiable agents
• Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems
• Children crying at birthday parties. Why?
• Allocation rules for games with optimistic aspirations
• Parallel axiomatizations of weighted and multiweighted Shapley values, random order values, and the Harsanyi set
• Characterizing the Shapley value in fixed-route traveling salesman problems with appointments
• Weakly monotonic solutions for cooperative games
• Cost sharing in a job scheduling problem
• Proportionate flow shop games
• Fairness and implementability in allocation of indivisible objects with monetary compensations
• Characterizations of pivotal mechanisms in the queueing problem
• Understanding the coincidence of allocation rules: symmetry and orthogonality in TU-games
• Efficiency and compromise: a bid-offer-counteroffer mechanism with two players
• Egalitarianism in the queueing problem
• Constrained core solutions for totally positive games with ordered players
• The interval Shapley value of an M/M/1 service system
• Approximating the least core value and least core of cooperative games with supermodular costs
• On the coincidence of the prenucleolus and the Shapley value
• Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines
• No-envy in the queueing problem with multiple identical machines
• Prior-free online mechanisms for queueing with arrivals
• Component efficient solutions in line-graph games with applications
• Second-best mechanisms in queuing problems without transfers: the role of random priorities
• Reconciling marginalism with egalitarianism: consistency, monotonicity, and implementation of egalitarian Shapley values
• Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value
• The Shapley value, the proper Shapley value, and sharing rules for cooperative ventures
• Incentives and justice for sequencing problems
• On proper Shapley values for monotone TU-games
• Knapsack cost sharing
• Comparable characterizations of four solutions for permission tree games
• A pessimistic approach to the queueing problem
• No-envy in queueing problems
• Processing games with restricted capacities
• Reordering an existing queue
• Computer science and decision theory
• On the number of blocks required to access the core
• Capacity allocation games without an initial sequence
• The optimistic \(TU\) game in minimum cost spanning tree problems
• Welfare lower bounds and strategy-proofness in the queueing problem
• Axiomatizations of two types of Shapley values for games on union closed systems
• Axiomatic characterizations of the core without consistency
• Allocating positions fairly: auctions and Shapley value
• A fair staff allocation rule for the capacity pooling of multiple call centers
• On the axiomatic approach to sharing the revenues from broadcasting sports leagues
• Balanced VCG mechanisms for sequencing problems
• Comments on: ``Recent developments in the queueing problem
• The on-line transfer rule for queueing with arrivals
• Generalized welfare lower bounds and strategyproofness in sequencing problems
• The degree measure as utility function over positions in graphs and digraphs
• On Harsanyi dividends and asymmetric values
• Queueing games with an endogenous number of machines
• Balanced externalities and the proportional allocation of nonseparable contributions
• The Shapley value in positional queueing problems
• Recent developments in the queueing problem

This page was built for publication: A characterization of the Shapley value in queueing problems

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