Computational aspects of uncertainty profiles and angel-daemon games
From MaRDI portal
Publication:2441541
DOI10.1007/s00224-013-9481-0zbMath1286.68190MaRDI QIDQ2441541
Maria J. Serna, Alina García, Joaquim Gabarró
Publication date: 25 March 2014
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-013-9481-0
computational complexity; Nash equilibrium; zero-sum games; fault tolerance; algorithmic game theory; succinct games; orchestrations; angel-daemon games
91A10: Noncooperative games
91A40: Other game-theoretic models
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of game isomorphism
- Equilibria problems on games: complexity versus succinctness
- Congestion games with malicious players
- A timed semantics of Orc
- Equilibria for networks with malicious users
- A new fault-tolerant algorithm for clock synchronization
- A class of games possessing pure-strategy Nash equilibria
- Web Services and Incerta Spiriti: A Game Theoretic Approach to Uncertainty
- Uncertainty in Interdependent Security Games
- The Price of Malice: A Game-Theoretic Framework for Malicious Behavior in Distributed Systems
- Settling the complexity of computing two-player Nash equilibria
- The complexity of pure Nash equilibria
- The Orc Programming Language
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- The Byzantine generals strike again
- Fault Tolerant Implementation
- Stackelberg scheduling strategies
- The Complexity of Computing a Nash Equilibrium
- Algorithmic Game Theory
- Broadcast in radio networks tolerating byzantine adversarial behavior
- Computing correlated equilibria in multi-player games
