A Characterization of Undirected Graphs Admitting Optimal Cost Shares
From MaRDI portal
Recommendations
- A characterization of undirected graphs admitting optimal cost shares
- A characterization of kruskal sharing rules for minimum cost spanning tree problems
- A general theory of sharing graphs
- On maximin share allocations in matroids
- Sharing the cost of maximum quality optimal spanning trees
- A class of uniformly optimality complete multi-partite graphs
- Approximate maximin share allocations in matroids
- The fair sharing graph and its Helly property
- A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
- Cost sharing over combinatorial domains : Complement-free cost functions and beyond
Cites work
- A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
- A course in game theory.
- An \(H _{n/2}\) upper bound on the price of stability of undirected network design games
- An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games
- Competitive cost sharing with economies of scale
- Cost-sharing in generalised selfish routing
- Designing network protocols for good equilibria
- Designing networks with good equilibria under uncertainty
- Efficient black-box reductions for separable cost sharing
- Efficient graph topologies in network routing games
- Improved lower bounds on the price of stability of undirected network design games
- Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games
- Near-optimal network design with selfish agents
- Network characterizations for excluding Braess's paradox
- Network cost-sharing without anonymity
- Network design with weighted players
- Network topologies for weakly Pareto optimal nonatomic selfish routing
- Network topology and the efficiency of equilibrium
- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
- On the price of stability for undirected network design
- Optimal cost sharing for capacitated facility location games
- Optimal cost sharing for resource selection games
- Optimal cost-sharing in general resource selection games
- Potential games are \textit{necessary} to ensure pure Nash equilibria in cost sharing games
- Resource buying games
- Sharing non-anonymous costs of multiple resources optimally
- The Price of Stability for Network Design with Fair Cost Allocation
- The price of stability for undirected broadcast network design with fair cost allocation is constant
- Tight bounds for cost-sharing in weighted congestion games
Cited in
(2)
This page was built for publication: A Characterization of Undirected Graphs Admitting Optimal Cost Shares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5238743)
