Optimal cost sharing for capacitated facility location games
From MaRDI portal
Recommendations
Cites work
- A course in game theory.
- A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
- An efficient and almost budget balanced cost sharing method
- Approximation and collusion in multicast cost sharing
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Competitive cost sharing with economies of scale
- Congestion games with player-specific payoff functions
- Convergence time to Nash equilibrium in load balancing
- Coordination mechanisms for selfish scheduling
- Design of price mechanisms for network resource allocation via price of anarchy
- Designing fast converging cost sharing methods for multicast transmissions
- Designing network protocols for good equilibria
- Efficiency of scalar-parameterized mechanisms
- Efficient coordination mechanisms for unrelated machine scheduling
- scientific article; zbMATH DE number 4215340 (Why is no real title available?)
- scientific article; zbMATH DE number 1306870 (Why is no real title available?)
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- scientific article; zbMATH DE number 2086616 (Why is no real title available?)
- Inner product spaces for minsum coordination mechanisms
- Network design with weighted players
- On the existence of pure Nash equilibria in weighted congestion games
- On the value of coordination in network design
- Optimal cost sharing for resource selection games
- Pure Nash equilibria in player-specific and weighted congestion games
- Restoring Pure Equilibria to Weighted Congestion Games
- Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
- Selfish Routing in Capacitated Networks
- Sharing the cost of a capacity network
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- Strong equilibrium in cost sharing connection games
- Structure preserving reductions among convex optimization problems
- The congested facility location problem
- The price of anarchy of serial, average and incremental cost sharing
- The Price of Stability for Network Design with Fair Cost Allocation
- The worst-case efficiency of cost sharing methods in resource allocation games
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Worst-case equilibria
Cited in
(14)- A logarithmic approximation for polymatroid congestion games
- How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium
- A cross-monotonic cost-sharing scheme for the concave facility location game
- Constrained heterogeneous facility location games with max-variant cost
- The price of anarchy as a classifier for mechanism design in a Pareto-Bayesian-Nash context
- Sharing the cost more efficiently
- Non-cooperative capacitated facility location games
- Efficient black-box reductions for separable cost sharing
- Efficient black-box reductions for separable cost sharing
- Optimal cost sharing for resource selection games
- A Characterization of Undirected Graphs Admitting Optimal Cost Shares
- On the Core of Cost Allocation Games Defined on Location Problems
- Cooperative games in facility location situations with regional fixed costs
- Cross-monotonic cost sharing methods for connected facility location games
This page was built for publication: Optimal cost sharing for capacitated facility location games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297094)
