Pareto optimal equilibria for selfish bin packing with uniform cost sharing

György Dósa; Leah Epstein

doi:10.1007/s10878-018-0323-5

Pareto optimal equilibria for selfish bin packing with uniform cost sharing

György Dósa, Leah Epstein

Department of Mathematics

University of Haifa

Research output: Contribution to journal › Article › peer-review

Abstract

Bin packing problems deal with packing a set of items with sizes in (0, 1] into a minimum number of subsets, called bins, whose total sizes are no larger than 1. We study a class of bin packing games where the cost of an item packed into a bin with k items is 1k, that is, the cost sharing of each bin is uniform. We study the quality of strictly Pareto optimal equilibria and weakly Pareto optimal equilibria for these games.

Original language	American English
Pages (from-to)	827-847
Number of pages	21
Journal	Journal of Combinatorial Optimization
Volume	37
Issue number	3
DOIs	https://doi.org/10.1007/s10878-018-0323-5
State	Published - 1 Apr 2019

Keywords

Bin packing
Nash equilibrium
Pareto optimality
Selfish players

All Science Journal Classification (ASJC) codes

Computer Science Applications
Discrete Mathematics and Combinatorics
Control and Optimization
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1007/s10878-018-0323-5

Cite this

@article{00d204e9c4134e338829e9d6ebbed0b4,

title = "Pareto optimal equilibria for selfish bin packing with uniform cost sharing",

abstract = "Bin packing problems deal with packing a set of items with sizes in (0, 1] into a minimum number of subsets, called bins, whose total sizes are no larger than 1. We study a class of bin packing games where the cost of an item packed into a bin with k items is 1k, that is, the cost sharing of each bin is uniform. We study the quality of strictly Pareto optimal equilibria and weakly Pareto optimal equilibria for these games.",

keywords = "Bin packing, Nash equilibrium, Pareto optimality, Selfish players",

author = "Gy{\"o}rgy D{\'o}sa and Leah Epstein",

note = "Publisher Copyright: {\textcopyright} 2018, Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2019",

month = apr,

day = "1",

doi = "10.1007/s10878-018-0323-5",

language = "American English",

volume = "37",

pages = "827--847",

journal = "Journal of Combinatorial Optimization",

issn = "1382-6905",

publisher = "Springer Netherlands",

number = "3",

}

TY - JOUR

T1 - Pareto optimal equilibria for selfish bin packing with uniform cost sharing

AU - Dósa, György

AU - Epstein, Leah

PY - 2019/4/1

Y1 - 2019/4/1

N2 - Bin packing problems deal with packing a set of items with sizes in (0, 1] into a minimum number of subsets, called bins, whose total sizes are no larger than 1. We study a class of bin packing games where the cost of an item packed into a bin with k items is 1k, that is, the cost sharing of each bin is uniform. We study the quality of strictly Pareto optimal equilibria and weakly Pareto optimal equilibria for these games.

AB - Bin packing problems deal with packing a set of items with sizes in (0, 1] into a minimum number of subsets, called bins, whose total sizes are no larger than 1. We study a class of bin packing games where the cost of an item packed into a bin with k items is 1k, that is, the cost sharing of each bin is uniform. We study the quality of strictly Pareto optimal equilibria and weakly Pareto optimal equilibria for these games.

KW - Bin packing

KW - Nash equilibrium

KW - Pareto optimality

KW - Selfish players

UR - http://www.scopus.com/inward/record.url?scp=85049219902&partnerID=8YFLogxK

U2 - 10.1007/s10878-018-0323-5

DO - 10.1007/s10878-018-0323-5

M3 - Article

SN - 1382-6905

VL - 37

SP - 827

EP - 847

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

IS - 3

ER -

Pareto optimal equilibria for selfish bin packing with uniform cost sharing

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this