scientific article; zbMATH DE number 7561639
From MaRDI portal
DOI10.4230/LIPIcs.ICALP.2019.146MaRDI QIDQ5092351
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parallel algorithmsfault-toleranceprice of anarchyalgorithmic mechanism designprice of stabilitycollaborative searchsymmetric equilibria
Cites Work
- Unnamed Item
- Worst-case equilibria
- A computer scientist looks at game theory.
- Potential games
- Fault tolerance in large games
- Online graph exploration algorithms for cycles and trees by multiple searchers
- Fast collaborative graph exploration
- The ANTS problem
- A class of games possessing pure-strategy Nash equilibria
- Non-cooperative games
- Tight bounds for worst-case equilibria
- Coordination mechanisms from (almost) all scheduling policies
- Solving the ANTS Problem with Asynchronous Finite State Machines
- Parallel Bayesian Search with No Coordination
- Mechanisms for (mis)allocating scientific credit
- Algorithmic Game Theory