Selfish bin coloring

DOI10.1007/s10878-010-9302-1zbMath1237.91060OpenAlexW1998033688MaRDI QIDQ411255

Heike Sperber, Sven O. Krumke, Leah Epstein, Asaf Levin

Publication date: 4 April 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9302-1

zbMATH Keywords

Nash equilibriaprice of anarchyalgorithmic game theoryprice of stabilitybin coloringextreme Nash equilibriastrong equilibriaweakly/strictly Pareto optimal Nash equilibria

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Combinatorial optimization (90C27) Combinatorial games (91A46)

Related Items

Selfish colorful bin packing games, On the sequential price of anarchy of isolation games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Worst-case equilibria
• Tight bounds for online class-constrained packing
• The structure and complexity of Nash equilibria for a selfish routing game
• On the structure and complexity of worst-case equilibria
• Almost optimal solutions for bin coloring problems
• Bincoloring
• The price of selfish routing
• Strong price of anarchy
• Efficient graph topologies in network routing games
• How hard is it to find extreme Nash equilibria in network congestion games?
• Polynomial time approximation schemes for class-constrained packing problems
• Strong equilibrium in congestion games
• The class constrained bin packing problem with applications to video-on-demand
• Tight bounds for worst-case equilibria
• Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
• Strong and Pareto Price of Anarchy in Congestion Games