A Best Cost-Sharing Rule for Selfish Bin Packing

04/20/2022
by   Changjun Wang, et al.
0

In selfish bin packing, each item is regarded as a player, who aims to minimize the cost-share by choosing a bin it can fit in. To have a least number of bins used, cost-sharing rules play an important role. The currently best known cost sharing rule has a lower bound on PoA larger than 1.45, while a general lower bound 4/3 on PoA applies to any cost-sharing rule under which no items have incentive unilaterally moving to an empty bin. In this paper, we propose a novel and simple rule with a PoA matching the lower bound, thus completely resolving this game. The new rule always admits a Nash equilibrium and its PoS is one. Furthermore, the well-known bin packing algorithm BFD (Best-Fit Decreasing) is shown to achieve a strong equilibrium, implying that a stable packing with an asymptotic approximation ratio of 11/9 can be produced in polynomial time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/23/2018

A lower bound for online rectangle packing

We slightly improve the known lower bound on the asymptotic competitive ...
research
07/25/2017

Prices of anarchy of selfish 2D bin packing games

We consider a game-theoretical problem called selfish 2-dimensional bin ...
research
10/14/2020

More on ordered open end bin packing

We consider the Ordered Open End Bin Packing problem. Items of sizes in ...
research
11/09/2017

On Colorful Bin Packing Games

We consider colorful bin packing games in which selfish players control ...
research
04/17/2023

Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud

Several cloud-based applications, such as cloud gaming, rent servers to ...
research
05/23/2019

Approximation schemes for the generalized extensible bin packing problem

We present a new generalization of the extensible bin packing with unequ...
research
01/31/2020

Stochastic Extensible Bin Packing

We consider the stochastic extensible bin packing problem (SEBP) in whic...

Please sign up or login with your details

Forgot password? Click here to reset