The price of anarchy for a berth allocation game

DOI10.1007/S10951-023-00791-9zbMATH Open1542.90113MaRDI QIDQ6547129FDOQ6547129

Authors Jiayin Pan, Cong Chen, Yinfeng Xu 

Publication date 30 May 2024

Published in Journal of Scheduling (Search for Journal in Brave)

zbMATH Keywords

price of anarchymultiprocessor task schedulingberth allocation game

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Noncooperative games (91A10)

Recommendations

• Maximizing the minimum load: the cost of selfishness
• The price of anarchy for utilitarian scheduling games on related machines
• Allocation game on \(m\)-uniform parallel machines
• Selfish load balancing
• The cost of selfishness for maximizing the minimum load on uniformly related machines

Cites Work

• scientific article; zbMATH DE number 1271325 (Why is no real title available?)
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• A linear time approximation algorithm for multiprocessor scheduling
• A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
• A simple linear time approximation algorithm for multi-processor job scheduling on four processors
• Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey
• Concurrent Task Systems
• Non-cooperative games
• Performance guarantees of local search for multiprocessor scheduling
• Risk-averse selfish routing
• Selfish routing with atomic players
• Strong price of anarchy
• The consecutive multiprocessor job scheduling problem
• Tight bounds for worst-case equilibria
• Tradeoffs in worst-case equilibria
• Worst-case equilibria

This page was built for publication: The price of anarchy for a berth allocation game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547129)