Competitive multi-agent scheduling with an iterative selection rule
From MaRDI portal
Publication:1743639
DOI10.1007/S10288-017-0341-7zbMath1390.90321OpenAlexW2586520153WikidataQ59606014 ScholiaQ59606014MaRDI QIDQ1743639
Andrea Pacifici, Gaia Nicosia, Ulrich Pferschy
Publication date: 13 April 2018
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-017-0341-7
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) (n)-person games, (n>2) (91A06) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Strategies in competing subset selection
- Competitive subset selection with two agents
- On the shortest path game
- Truthful algorithms for scheduling selfish tasks on parallel machines
- Coordination mechanisms for selfish scheduling
- Approximation schemes for two-agent scheduling on parallel machines
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- Two agent scheduling with a central selection mechanism
- Scheduling two agent task chains with a central selection mechanism
- Single-machine multi-agent scheduling problems with a global objective function
- A multiple-criterion model for machine scheduling
- Multicriteria scheduling problems: a survey
- Algorithmic mechanism design (extended abstract)
- Two Agents Competing for a Shared Machine
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Multiagent Scheduling
This page was built for publication: Competitive multi-agent scheduling with an iterative selection rule
