A characterization of the Shapley value in queueing problems
From MaRDI portal
Publication:1810697
DOI10.1016/S0022-0531(02)00036-4zbMath1032.91020MaRDI QIDQ1810697
Publication date: 9 June 2003
Published in: Journal of Economic Theory (Search for Journal in Brave)
Related Items (69)
Axiomatic characterizations under players nullification ⋮ On the axiomatic approach to sharing the revenues from broadcasting sports leagues ⋮ Proportionate flow shop games ⋮ Subgroup additivity in the queueing problem ⋮ Efficiency and compromise: a bid-offer-counteroffer mechanism with two players ⋮ Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems ⋮ Component efficient solutions in line-graph games with applications ⋮ Cost sharing in a job scheduling problem ⋮ On Harsanyi Dividends and Asymmetric Values ⋮ Incentives and justice for sequencing problems ⋮ Children crying at birthday parties. Why? ⋮ The interval Shapley value of an M/M/1 service system ⋮ No-envy, solidarity, and strategy-proofness in the queueing problem ⋮ The degree measure as utility function over positions in graphs and digraphs ⋮ Second-best mechanisms in queuing problems without transfers: the role of random priorities ⋮ From hierarchies to levels: new solutions for games with hierarchical structure ⋮ Axiomatic characterizations of the core without consistency ⋮ Egalitarianism in the queueing problem ⋮ Recent developments in the queueing problem ⋮ Auctioning and selling positions: a non-cooperative approach to queueing conflicts ⋮ Balanced externalities and the proportional allocation of nonseparable contributions ⋮ Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines ⋮ Balanced VCG mechanisms for sequencing problems ⋮ 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 ⋮ Reordering an existing queue ⋮ Capacity allocation games without an initial sequence ⋮ Allocation rules for games with optimistic aspirations ⋮ Approximating the least core value and least core of cooperative games with supermodular costs ⋮ Parallel axiomatizations of weighted and multiweighted Shapley values, random order values, and the Harsanyi set ⋮ A fair staff allocation rule for the capacity pooling of multiple call centers ⋮ Weakly monotonic solutions for cooperative games ⋮ Reconciling marginalism with egalitarianism: consistency, monotonicity, and implementation of egalitarian Shapley values ⋮ Constrained core solutions for totally positive games with ordered players ⋮ Characterizations of pivotal mechanisms in the queueing problem ⋮ Proportional scheduling, split-proofness, and merge-proofness ⋮ Understanding the coincidence of allocation rules: symmetry and orthogonality in TU-games ⋮ Fairness and implementability in allocation of indivisible objects with monetary compensations ⋮ The optimistic \(TU\) game in minimum cost spanning tree problems ⋮ Allocating positions fairly: auctions and Shapley value ⋮ Cooperation in Markovian queueing models ⋮ Sharing a river among satiable agents ⋮ Egalitarian equivalence and strategyproofness in the queueing problem ⋮ Cost allocation in rescheduling with machine unavailable period ⋮ Comparable characterizations of four solutions for permission tree games ⋮ Welfare lower bounds and strategy-proofness in the queueing problem ⋮ Switching queues, cultural conventions, and social welfare ⋮ Knapsack cost sharing ⋮ 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 ⋮ The average tree permission value for games with a permission tree ⋮ Games with a local permission structure: separation of authority and value generation ⋮ Computer science and decision theory ⋮ A characterization of the symmetrically balanced VCG rule in the queueing problem ⋮ No-envy in queueing problems ⋮ A pessimistic approach to the queueing problem ⋮ Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value ⋮ On the coincidence of the prenucleolus and the Shapley value ⋮ The Shapley value, the proper Shapley value, and sharing rules for cooperative ventures ⋮ Prior-free online mechanisms for queueing with arrivals ⋮ Processing games with restricted capacities ⋮ On proper Shapley values for monotone TU-games ⋮ No-envy in the Queueing Problem with Multiple Identical Machines ⋮ Comments on: ``Recent developments in the queueing problem
Cites Work
- Unnamed Item
- On weighted Shapley values
- Welfare bounds in the fair division problem
- Refinements of the no-envy solution in economies with indivisible goods
- Trade-off between equity and efficiency in a general economy with indivisible goods
- The fair allocation of an indivisible good when monetary compensations are possible
- Welfare-domination under preference-replacement: a survey and open questions
- On monotonicity in economies with indivisible goods
- The Fair Division of a Fixed Supply Among a Growing Population
- Fair Allocation of Indivisible Goods and Criteria of Justice
- Equality of Resources Implies Equality of Welfare
- The Pure Compensation Problem: Egalitarianism Versus Laissez-Fairism
- No-Envy and Consistency in Economies with Indivisible Goods
- An Application of the Shapley Value to Fair Division with Money
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
This page was built for publication: A characterization of the Shapley value in queueing problems
