Optimal cost sharing for capacitated facility location games
From MaRDI portal
Publication:297094
DOI10.1016/j.ejor.2014.04.048zbMath1339.90196OpenAlexW2078146027MaRDI QIDQ297094
Tobias Harks, Philipp von Falkenhausen
Publication date: 24 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.048
Related Items
How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium, Unnamed Item, The price of anarchy as a classifier for mechanism design in a Pareto-Bayesian-Nash context, A logarithmic approximation for polymatroid congestion games, A Characterization of Undirected Graphs Admitting Optimal Cost Shares, Efficient Black-Box Reductions for Separable Cost Sharing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Competitive cost sharing with economies of scale
- Design of price mechanisms for network resource allocation via price of anarchy
- Network design with weighted players
- Strong equilibrium in cost sharing connection games
- The price of anarchy of serial, average and incremental cost sharing
- An efficient and almost budget balanced cost sharing method
- Pure Nash equilibria in player-specific and weighted congestion games
- Coordination mechanisms for selfish scheduling
- Structure preserving reductions among convex optimization problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Approximation and collusion in multicast cost sharing
- Congestion games with player-specific payoff functions
- Designing fast converging cost sharing methods for multicast transmissions
- The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games
- Restoring Pure Equilibria to Weighted Congestion Games
- Designing Network Protocols for Good Equilibria
- Efficiency of Scalar-Parameterized Mechanisms
- Sharing the Cost of a Capacity Network
- The Price of Stability for Network Design with Fair Cost Allocation
- A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
- Convergence time to Nash equilibrium in load balancing
- Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
- On the Value of Coordination in Network Design
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- The congested facility location problem
- Optimal Cost Sharing for Resource Selection Games
- Inner product spaces for MinSum coordination mechanisms
- Selfish Routing in Capacitated Networks
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games
- Strategyproof sharing of submodular costs: budget balance versus efficiency
