Pareto optimal equilibria for selfish bin packing with uniform cost sharing
From MaRDI portal
Publication:2424651
DOI10.1007/s10878-018-0323-5zbMath1425.90089OpenAlexW2811015266MaRDI QIDQ2424651
Publication date: 25 June 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0323-5
Noncooperative games (91A10) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)
Related Items (3)
Quality of equilibria for selfish bin packing with cost sharing variants ⋮ Selfish vector packing ⋮ Magnitude of inefficiency
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametric packing of selfish items and the subset sum algorithm
- Selfish bin packing
- Strong equilibrium in cost sharing connection games
- Strong price of anarchy
- Strong equilibrium in congestion games
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- A note on a selfish bin packing problem
- Non-cooperative games
- Selfish Square Packing
- Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games
- The Price of Stability for Network Design with Fair Cost Allocation
- Pareto Optimality
- Strong and Pareto Price of Anarchy in Congestion Games
- Inefficiency of Nash Equilibria
- A simple on-line bin-packing algorithm
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Strong Price of Anarchy for Machine Load Balancing
This page was built for publication: Pareto optimal equilibria for selfish bin packing with uniform cost sharing
