The price of anarchy for a berth allocation game

DOI10.1007/s10951-023-00791-9zbMATH Open1542.90113MaRDI QIDQ6547129

Yinfeng Xu, Jiayin Pan, Cong Chen

Publication date: 30 May 2024

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

zbMATH Keywords

multiprocessor task schedulingprice of anarchyberth allocation game

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• A simple linear time approximation algorithm for multi-processor job scheduling on four processors
• Strong price of anarchy
• An almost ideal coordination mechanism for unrelated machine scheduling
• A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
• Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey
• The consecutive multiprocessor job scheduling problem
• Tradeoffs in worst-case equilibria
• Non-cooperative games
• Performance Guarantees of Local Search for Multiprocessor Scheduling
• Tight bounds for worst-case equilibria
• A linear time approximation algorithm for multiprocessor scheduling
• Concurrent Task Systems
• Risk-Averse Selfish Routing

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