Selfish bin packing
From MaRDI portal
Publication:534779
DOI10.1007/S00453-009-9348-6zbMATH Open1213.90211OpenAlexW2128578725WikidataQ105583416 ScholiaQ105583416MaRDI QIDQ534779FDOQ534779
Publication date: 10 May 2011
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-009-9348-6
Recommendations
Combinatorial optimization (90C27) Applications of game theory (91A80) Agent technology and artificial intelligence (68T42)
Cites Work
- Non-cooperative games
- Worst-case equilibria
- Coalition-proof Nash equilibria. I: Concepts
- How bad is selfish routing?
- Worst-case analysis of the subset sum algorithm for bin packing.
- The Price of Stability for Network Design with Fair Cost Allocation
- A simple on-line bin-packing algorithm
- Strong Price of Anarchy for Machine Load Balancing
- Title not available (Why is that?)
- Approximate equilibria and ball fusion
- Title not available (Why is that?)
- Atomic Congestion Games Among Coalitions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms, games, and the internet
- The effect of collusion in congestion games
- Strong equilibrium in congestion games
- Title not available (Why is that?)
- The price of selfish routing
- Near-optimal network design with selfish agents
- Title not available (Why is that?)
- Selfish Bin Packing
- STACS 2004
Cited In (27)
- A new lower bound on the price of anarchy of selfish bin packing
- Quality of equilibria for selfish bin packing with cost sharing variants
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- Parametric packing of selfish items and the subset sum algorithm
- An Incentive Mechanism for Selfish Bin Covering
- Using weight decision for decreasing the price of anarchy in selfish bin packing games
- Approximate core allocations and integrality gap for the bin packing game
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing
- An improved mechanism for selfish bin packing
- Selfish bin packing with cardinality constraints
- Bin packing game with a price of anarchy of \(\frac{3}{2}\)
- A general bin packing game: interest taken into account
- Selfish Vector Packing
- The Subset Sum game
- On the sequential price of anarchy of isolation games
- A note on a selfish bin packing problem
- Selfish bin packing under harmonic mean cost sharing mechanism
- Selfish bin packing with punishment
- Prices of Anarchy of Selfish 2D Bin Packing Games
- Selfish colorful bin packing games
- Selfish Bin Packing
- Scheduling selfish jobs on multidimensional parallel machines
- Selfish bin covering
- A bin packing game with cardinality constraints under the best cost rule
- From packing rules to cost-sharing mechanisms
- The intermediate price of anarchy (IPoA) in bin packing games
- Selfish vector packing
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)
