Optimal cost-sharing in general resource selection games
From MaRDI portal
Recommendations
Cites work
- A Characterization of Waiting Time Performance Realizable by Single-Server Queues
- A class of games possessing pure-strategy Nash equilibria
- Characterizing the existence of potential functions in weighted congestion games
- Composable and efficient mechanisms
- Congestion games with player-specific payoff functions
- Coordination mechanisms
- Coordination mechanisms for selfish scheduling
- Coordination mechanisms from (almost) all scheduling policies
- Cost-balancing tolls for atomic network congestion games
- Decentralized utilitarian mechanisms for scheduling games
- Designing network protocols for good equilibria
- Distributed welfare games
- Efficient coordination mechanisms for unrelated machine scheduling
- How bad is selfish routing?
- Intrinsic robustness of the price of anarchy
- Nonpreemptive coordination mechanisms for identical machines
- On the existence of pure Nash equilibria in weighted congestion games
- Optimal coordination mechanisms for unrelated machine scheduling
- Optimal cost sharing for resource selection games
- Optimal cost-sharing in weighted congestion games
- Potential games
- Potential games are \textit{necessary} to ensure pure Nash equilibria in cost sharing games
- Preemptive coordination mechanisms for unrelated machines
- Price of anarchy for greedy auctions
- Restoring Pure Equilibria to Weighted Congestion Games
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- The impact of oligopolistic competition in networks
- The network equilibrium problem in integers
- The price of anarchy in an exponential multi-server
- The price of anarchy of serial, average and incremental cost sharing
- The price of routing unsplittable flow
- The Price of Stability for Network Design with Fair Cost Allocation
- The worst-case efficiency of cost sharing methods in resource allocation games
- Weighted congestion games: price of anarchy, universal worst-case examples, and tightness
- Worst-Case Efficiency Analysis of Queueing Disciplines
Cited in
(29)- Inefficiency and complementarity in sharing games
- Is Shapley cost sharing optimal?
- Opportunity costs in the game of best choice
- How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium
- Cost-sharing strategy for carbon emission reduction and sales effort: a Nash game with government subsidy
- The power of one evil secret agent
- Dynamic resource allocation games
- Stable cost sharing in production allocation games
- Generosity, selfishness and exploitation as optimal greedy strategies for resource sharing
- New techniques for cost sharing in combinatorial optimization games
- Dynamic resource allocation games
- The worst-case efficiency of cost sharing methods in resource allocation games
- Optimal cost-sharing in weighted congestion games
- Sharing non-anonymous costs of multiple resources optimally
- The power of one secret agent
- scientific article; zbMATH DE number 5666310 (Why is no real title available?)
- Optimal cost sharing for resource selection games
- A Characterization of Undirected Graphs Admitting Optimal Cost Shares
- Cost-sharing games in real-time scheduling systems
- Cost-sharing games in real-time scheduling systems
- Congestion games with priority-based scheduling
- The price of anarchy in loss systems
- Cost-sharing games with rank-based utilities
- Using Temporal Dummy Players in Cost-Sharing Games
- Utility-sharing games: how to improve the efficiency with limited subsidies
- Cost-sharing games with rank-based utilities
- On the Price of Anarchy of cost-sharing in real-time scheduling systems
- Utilitarian resource assignment
- Cost sharing mechanisms for fair pricing of resource usage
This page was built for publication: Optimal cost-sharing in general resource selection games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957453)
