Sharing sequential values in a network
From MaRDI portal
Publication:1622386
DOI10.1016/j.jet.2018.08.004zbMath1417.91045OpenAlexW2609676868MaRDI QIDQ1622386
Chiu Yu Ko, Jingyi Xue, Ruben Juarez
Publication date: 19 November 2018
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://ink.library.smu.edu.sg/soe_research/1906
Cooperative games (91A12) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (5)
Incentive-compatible simple mechanisms ⋮ Routing-proofness in congestion-prone networks ⋮ Profit-sharing and efficient time allocation ⋮ Coalitional efficient profit-sharing ⋮ Rationing Rules Under Uncertain Claims: A Survey
Cites Work
- Unnamed Item
- Optimal sharing rules in repeated partnerships
- Implementing efficient graphs in connection networks
- Sharing the proceeds from a hierarchical venture
- Decentralized pricing in minimum cost spanning trees
- Axiomatization of the Shapley value on minimum cost spanning tree games
- Cost monotonicity, consistency and minimum cost spanning tree games
- Non-manipulable division rules in claim problems and generalizations
- Minimum cost connection networks: truth-telling and implementation
- Sharing a river among satiable agents
- Game theoretic analysis of a bankruptcy problem from the Talmud
- Equal or proportional division of a surplus, and other methods
- Distributive justice in taxation
- A problem of rights arbitration from the Talmud
- Games with permission structures: The conjunctive approach
- Implementing a public project and distributing its cost
- Ordinal cost sharing
- An axiomatization of the disjunctive permission value for games with a permission structure
- Public goods provision: Applying Jackson-Moulin mechanism for restricted agent characteristics
- Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey.
- Free intermediation in resource transmission
- Three methods to share joint costs or surplus
- Sharing a river.
- Axiomatizations of the conjunctive permission value for games with permission structures
- Truth-telling and Nash equilibria in minimum cost spanning tree models
- Sharing a polluted river
- Agreement, separability, and other axioms for quasi-linear social choice problems
- Group strategyproof cost sharing: the role of indifferences
- The worst absolute surplus loss in the problem of commons: random priority versus average cost
- A fair rule in minimum cost spanning tree problems
- On demand responsiveness in additive cost sharing
- The Bargaining Problem
- An Introduction to Allocation Rules
- Serial Cost Sharing
- A Simple Expression for the Shapley Value in a Special Case
- Cost allocation for a spanning tree
- Proportional Solutions to Bargaining Situations: Interpersonal Utility Comparisons
- Serial Cost-Sharing of Excludable Public Goods
- Priority Rules and Other Asymmetric Rationing Methods
- On the Discrete Version of the Aumann-Shapley Cost-Sharing Method
- The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule
This page was built for publication: Sharing sequential values in a network
