Recommendations
Cites work
- scientific article; zbMATH DE number 6118219 (Why is no real title available?)
- scientific article; zbMATH DE number 3139273 (Why is no real title available?)
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- scientific article; zbMATH DE number 2086616 (Why is no real title available?)
- scientific article; zbMATH DE number 2119691 (Why is no real title available?)
- A simple on-line bin-packing algorithm
- Algorithms, games, and the internet
- Approximate equilibria and ball fusion
- Atomic Congestion Games Among Coalitions
- Coalition-proof Nash equilibria. I: Concepts
- How bad is selfish routing?
- Near-optimal network design with selfish agents
- Non-cooperative games
- STACS 2004
- Selfish Bin Packing
- Strong Price of Anarchy for Machine Load Balancing
- Strong equilibrium in congestion games
- Strong price of anarchy
- The Price of Stability for Network Design with Fair Cost Allocation
- The effect of collusion in congestion games
- The price of selfish routing
- Worst-case analysis of the subset sum algorithm for bin packing.
- Worst-case equilibria
Cited in
(30)- Scheduling selfish jobs on multidimensional parallel machines
- A general bin packing game: interest taken into account
- The intermediate price of anarchy (IPoA) in bin packing games
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- The quality of equilibria for set packing and throughput scheduling games
- Selfish square packing
- Selfish bin coloring
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing
- From packing rules to cost-sharing mechanisms
- Selfish vector packing
- On the sequential price of anarchy of isolation games
- Prices of anarchy of selfish 2D bin packing games
- A new lower bound on the price of anarchy of selfish bin packing
- Selfish vector packing
- Quality of equilibria for selfish bin packing with cost sharing variants
- Selfish colorful bin packing games
- A bin packing game with cardinality constraints under the best cost rule
- Selfish bin packing with punishment
- Bin packing game with a price of anarchy of \(\frac{3}{2}\)
- Selfish Bin Packing
- An improved mechanism for selfish bin packing
- An incentive mechanism for selfish bin covering
- Parametric packing of selfish items and the subset sum algorithm
- Selfish bin covering
- Selfish bin packing with cardinality constraints
- Approximate core allocations and integrality gap for the bin packing game
- Using weight decision for decreasing the price of anarchy in selfish bin packing games
- A note on a selfish bin packing problem
- The Subset Sum game
- Selfish bin packing under harmonic mean cost sharing mechanism
This page was built for publication: Selfish bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534779)
