Selfish Vector Packing

DOI10.1007/978-3-662-48350-3_40zbMath1466.90086OpenAlexW2259348270MaRDI QIDQ3452809

Leah Epstein, Elena Kleiman

Publication date: 19 November 2015

Published in: Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48350-3_40

Mathematics Subject Classification ID

Combinatorial optimization (90C27) (n)-person games, (n>2) (91A06) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (4)

Scheduling selfish jobs on multidimensional parallel machines ⋮ Quality of equilibria for selfish bin packing with cost sharing variants ⋮ Selfish vector packing ⋮ Selfish colorful bin packing games

Cites Work

• Unnamed Item
• Unnamed Item
• Parametric packing of selfish items and the subset sum algorithm
• Selfish bin packing
• The price of selfish routing
• Strong price of anarchy
• Resource constrained scheduling as generalized bin packing
• Strong equilibrium in congestion games
• A note on a selfish bin packing problem
• 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
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Multidimensional Bin Packing Algorithms
• On Multidimensional Packing Problems
• Strong Price of Anarchy for Machine Load Balancing

This page was built for publication: Selfish Vector Packing