TY - GEN
T1 - Bin packing games with selfish items
AU - Epstein, Leah
PY - 2013
Y1 - 2013
N2 - We discuss recent work on the subject of selfish bin packing. In these problems, items are packed into bins, such that each item wishes to minimize its own payoff. We survey the known results for a number of variants, focusing on worst-case Nash equilibria and other kinds of equilibria, and mentioning several results regarding issues of complexity and convergence to equilibria.
AB - We discuss recent work on the subject of selfish bin packing. In these problems, items are packed into bins, such that each item wishes to minimize its own payoff. We survey the known results for a number of variants, focusing on worst-case Nash equilibria and other kinds of equilibria, and mentioning several results regarding issues of complexity and convergence to equilibria.
UR - http://www.scopus.com/inward/record.url?scp=84885221974&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-40313-2_2
DO - 10.1007/978-3-642-40313-2_2
M3 - Conference contribution
AN - SCOPUS:84885221974
SN - 9783642403125
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 8
EP - 21
BT - Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings
T2 - 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013
Y2 - 26 August 2013 through 30 August 2013
ER -