The intermediate price of anarchy (IPoA) in bin packing games

DOI10.1016/j.dam.2017.10.010zbMath1386.91020OpenAlexW2768536740MaRDI QIDQ1744237

György Dósa

Publication date: 20 April 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.10.010

zbMATH Keywords

price of anarchybin packing game

Mathematics Subject Classification ID

Noncooperative games (91A10) Combinatorial optimization (90C27)

Related Items (1)

How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium

Cites Work

• Unnamed Item
• Unnamed Item
• Parametric packing of selfish items and the subset sum algorithm
• Selfish bin packing
• Strong price of anarchy
• Strong equilibrium in congestion games
• A note on a selfish bin packing problem
• Bin Packing Game with an Interest Matrix
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

This page was built for publication: The intermediate price of anarchy (IPoA) in bin packing games