Selfish vector packing

DOI10.1007/s00453-021-00849-0OpenAlexW3178859750MaRDI QIDQ1979465

Elena Kleiman, Leah Epstein

Publication date: 2 September 2021

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-021-00849-0

zbMATH Keywords

bin packingprice of anarchyvector packing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

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 general bin packing game: interest taken into account
• Quality of equilibria for selfish bin packing with cost sharing variants
• A new lower bound on the price of anarchy of selfish bin packing
• Quality of strong equilibria for selfish bin packing with uniform cost sharing
• A note on a selfish bin packing problem
• Pareto optimal equilibria for selfish bin packing with uniform cost sharing
• Using weight decision for decreasing the price of anarchy in selfish bin packing games
• The Convergence Time for Selfish Bin Packing
• Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games
• The Price of Stability for Network Design with Fair Cost Allocation
• Selfish Vector Packing
• Pareto Optimality
• Selfish Bin Packing
• 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
• The Convergence Time for Selfish Bin Packing
• On Multidimensional Packing Problems
• Strong Price of Anarchy for Machine Load Balancing

This page was built for publication: Selfish vector packing