Implementing efficient graphs in connection networks
From MaRDI portal
Publication:382330
DOI10.1007/S00199-012-0720-4zbMath1278.91092OpenAlexW2029268867MaRDI QIDQ382330
Publication date: 18 November 2013
Published in: Economic Theory (Search for Journal in Brave)
Full work available at URL: http://www.economics.hawaii.edu/research/workingpapers/WP_10-22.pdf
Noncooperative games (91A10) Games involving graphs (91A43) Deterministic network models in operations research (90B10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (14)
A monotonic and merge-proof rule in minimum cost spanning tree situations ⋮ Incentive-compatible simple mechanisms ⋮ Sharing sequential values in a network ⋮ Fairness and efficiency in cake-cutting with single-peaked preferences ⋮ Routing-proofness in congestion-prone networks ⋮ Minimum cost connection networks: truth-telling and implementation ⋮ An egalitarian solution to minimum cost spanning tree problems ⋮ Profit-sharing and efficient time allocation ⋮ Proportional rules for state contingent claims ⋮ Trouble comes in threes: core stability in minimum cost connection networks ⋮ Free intermediation in resource transmission ⋮ Coalitional efficient profit-sharing ⋮ Cost-allocation problems for fuzzy agents in a fixed-tree network ⋮ Rationing Rules Under Uncertain Claims: A Survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametric rationing methods
- Strong equilibrium in cost sharing connection games
- The price of anarchy of serial, average and incremental cost sharing
- An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games
- Strong price of anarchy
- Game theoretic analysis of a bankruptcy problem from the Talmud
- Distributive justice in taxation
- A problem of rights arbitration from the Talmud
- Bilateral comparisons and consistent fair division rules in the context of bankruptcy problems
- Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey.
- `Hydraulic' rationing
- Equilibrium selection in \(n\)-person coordination games
- Potential games
- Fictitious play property for games with identical interests
- Truth-telling and Nash equilibria in minimum cost spanning tree models
- Optimal combinatorial mechanism design
- Incremental cost sharing: Characterization by coalition strategy-proofness
- Group strategyproof cost sharing: the role of indifferences
- The worst absolute surplus loss in the problem of commons: random priority versus average cost
- On the existence of consistent rules to adjudicate conflicting claims: a constructive geometric approach
- Asymmetric rules for claims problems without homogeneity
- The Price of Stability for Network Design with Fair Cost Allocation
- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
- On Dividing an Amount According to Individual Claims or Liabilities
- Optimal Auction Design
- Priority Rules and Other Asymmetric Rationing Methods
- The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule
- Potential games with continuous player sets
- Strategyproof sharing of submodular costs: budget balance versus efficiency
This page was built for publication: Implementing efficient graphs in connection networks
