Recommendations
Cites work
- scientific article; zbMATH DE number 3139273 (Why is no real title available?)
- scientific article; zbMATH DE number 2038735 (Why is no real title available?)
- Almost optimal solutions for bin coloring problems
- Bincoloring
- Efficient graph topologies in network routing games
- How hard is it to find extreme Nash equilibria in network congestion games?
- Microeconomic theory
- Near-optimal network design with selfish agents
- On the structure and complexity of worst-case equilibria
- Polynomial time approximation schemes for class-constrained packing problems
- Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
- Strong and Pareto Price of Anarchy in Congestion Games
- Strong equilibrium in congestion games
- Strong price of anarchy
- The class constrained bin packing problem with applications to video-on-demand
- The price of selfish routing
- The structure and complexity of Nash equilibria for a selfish routing game
- Tight bounds for online class-constrained packing
- Tight bounds for worst-case equilibria
- Worst-case equilibria
- Worst-case equilibria
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
- scientific article; zbMATH DE number 1417714 (Why is no real title available?)
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)
