Selfish bin coloring

DOI10.1007/S10878-010-9302-1zbMATH Open1237.91060OpenAlexW1998033688MaRDI QIDQ411255FDOQ411255

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

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

Recommendations

• Selfish colorful bin packing games
• Prices of anarchy of selfish 2D bin packing games
• Selfish Bin Packing
• Selfish bin packing
• Bin packing games with selfish items

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Pareto optimal equilibria for selfish bin packing with uniform cost sharing
• Selfish bin packing
• On the sequential price of anarchy of isolation games
• Selfish colorful bin packing games
• Selfish Bin Packing
• Selfish bin covering
• Bin packing games with selfish items
• Title not available (Why is that?)

This page was built for publication: Selfish bin coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411255)