An egalitarian solution to minimum cost spanning tree problems
From MaRDI portal
Publication:6146788
DOI10.1007/s00182-023-00864-1MaRDI QIDQ6146788
Emre Doğan, İbrahim Barış Esmerok
Publication date: 31 January 2024
Published in: International Journal of Game Theory (Search for Journal in Brave)
Cites Work
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Absence-proofness: group stability beyond the core
- Implementing efficient graphs in connection networks
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
- Axiomatization of the Shapley value on minimum cost spanning tree games
- The egalitarian solution and reduced game properties in convex games
- Characterization of monotonic rules in minimum cost spanning tree problems
- On obligation rules for minimum cost spanning tree problems
- Sharing a minimal cost spanning tree: beyond the folk solution
- An axiomatic approach to egalitarianism in TU-games
- On the set of Lorenz-maximal imputations in the core of a balanced game
- Egalitarian solutions in the core
- Sharing the cost of a network: core and core allocations
- Minimum cost spanning tree games and population monotonic allocation schemes.
- The degree and cost adjusted folk solution for minimum cost spanning tree games
- Truth-telling and Nash equilibria in minimum cost spanning tree models
- Obligation rules for minimum cost spanning tree situations and their monotonicity properties
- ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
- A fair rule in minimum cost spanning tree problems
- The \(P\)-value for cost sharing in minimum
- A Concept of Egalitarianism Under Participation Constraints
- On cost allocation for a spanning tree: A game theoretic approach
This page was built for publication: An egalitarian solution to minimum cost spanning tree problems
