The price of anarchy for a berth allocation game
From MaRDI portal
Publication:6547129
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)
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Noncooperative games (91A10)
Cites Work
- Non-cooperative games
- Worst-case equilibria
- Strong price of anarchy
- Tight bounds for worst-case equilibria
- Concurrent Task Systems
- Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- An almost ideal coordination mechanism for unrelated machine scheduling
- Selfish routing with atomic players
- Performance guarantees of local search for multiprocessor scheduling
- A linear time approximation algorithm for multiprocessor scheduling
- Tradeoffs in worst-case equilibria
- A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
- Title not available (Why is that?)
- A simple linear time approximation algorithm for multi-processor job scheduling on four processors
- The consecutive multiprocessor job scheduling problem
- Risk-averse selfish routing
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)
