Selfish vector packing
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3139273 (Why is no real title available?)
- A general bin packing game: interest taken into account
- A new lower bound on the price of anarchy of selfish bin packing
- A note on a selfish bin packing problem
- Inefficiency of Nash Equilibria
- Multidimensional Bin Packing Algorithms
- On Multidimensional Packing Problems
- Parametric packing of selfish items and the subset sum algorithm
- Pareto Optimality
- Pareto efficiency and approximate Pareto efficiency in routing and load balancing games
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing
- Quality of equilibria for selfish bin packing with cost sharing variants
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- Resource constrained scheduling as generalized bin packing
- Selfish Bin Packing
- Selfish bin packing
- Selfish vector packing
- Strong Price of Anarchy for Machine Load Balancing
- Strong and Pareto Price of Anarchy in Congestion Games
- Strong equilibrium in congestion games
- Strong price of anarchy
- The Convergence Time for Selfish Bin Packing
- The Price of Stability for Network Design with Fair Cost Allocation
- The convergence time for selfish bin packing
- The price of selfish routing
- Using weight decision for decreasing the price of anarchy in selfish bin packing games
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Worst-case equilibria
Cited in
(4)
This page was built for publication: Selfish vector packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979465)
