The price of anarchy for a berth allocation game

Jiayin Pan (), Cong Chen () and Yinfeng Xu ()
Additional contact information
Jiayin Pan: Xi’an Jiaotong University
Cong Chen: Guangzhou University
Yinfeng Xu: Xi’an Jiaotong University

Journal of Scheduling, 2024, vol. 27, issue 1, No 3, 60 pages

Abstract: Abstract In this work, we investigate a berth allocation game involving m identical berths and n vessels. Each vessel selfishly selects a consecutive set of berths for unloading, with the objective of minimizing its own cost represented by the maximum load among the chosen berths. The social cost is defined as the makespan, i.e., the maximum load over all berths. Our game generalizes classical machine scheduling games where jobs (vessels) may require multiple consecutive machines (berths). We analyze the price of anarchy (PoA) of the berth allocation game, which quantifies the impact of selfish behaviors of vessels. Specifically, we first consider a special case where each job can occupy at most two consecutive machines, and derive exact upper and lower bounds for the PoA based on the number of machines m. We show that the PoA asymptotically approaches $$\frac{9}{4}$$ 9 4 . For the general case where each job can occupy an arbitrary number of consecutive machines, we obtain a tight bound for the PoA, which is $$\Theta \left( \frac{\log m}{\log \log m}\right) $$ Θ log m log log m .

Keywords: Berth allocation game; Price of anarchy; Multiprocessor task scheduling (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-023-00791-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:27:y:2024:i:1:d:10.1007_s10951-023-00791-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-023-00791-9

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().