Computational aspects of uncertainty profiles and angel-daemon games

DOI10.1007/S00224-013-9481-0MaRDI QIDQ2441541zbMATH OpenOpenAlexFDO

Authors Joaquim Gabarró, Alina García, Maria Serna

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

zbMATH Keywords

algorithmic game theoryangel-daemon gamescomputational complexityfault toleranceNash equilibriumorchestrationssuccinct gameszero-sum games

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Noncooperative games (91A10) Other game-theoretic models (91A40)

Recommendations

• On the Complexity of Equilibria Problems in Angel-Daemon Games
• Modelling web-service uncertainty: the angel/daemon approach
• Equilibria problems on games: complexity versus succinctness
• Web services and \textit{incerta spiriti}: a game theoretic approach to uncertainty
• An angel-daemon approach to assess the uncertainty in the power of a collectivity to act

Cites work

• A class of games possessing pure-strategy Nash equilibria
• A course in game theory.
• A new fault-tolerant algorithm for clock synchronization
• A timed semantics of Orc
• Algorithmic Game Theory
• Broadcast in radio networks tolerating Byzantine adversarial behavior
• Byzantine quorum systems
• Computing correlated equilibria in multi-player games
• Congestion games with malicious players
• Equilibria for networks with malicious users
• Equilibria problems on games: complexity versus succinctness
• Fault Tolerant Implementation
• scientific article; zbMATH DE number 5301288 (Why is no real title available?)
• scientific article; zbMATH DE number 561553 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 784042 (Why is no real title available?)
• scientific article; zbMATH DE number 2243403 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• Reaching Agreement in the Presence of Faults
• Settling the complexity of computing two-player Nash equilibria
• Stackelberg scheduling strategies
• The Byzantine Generals Problem
• The Byzantine generals strike again
• The complexity of computing a Nash equilibrium
• The complexity of finding Nash equilibria
• The complexity of game isomorphism
• The complexity of pure Nash equilibria
• The Orc Programming Language
• The Price of Malice: A Game-Theoretic Framework for Malicious Behavior in Distributed Systems
• Uncertainty in interdependent security games
• Web services and \textit{incerta spiriti}: a game theoretic approach to uncertainty

Cited in

(7)

• Versatile uncertainty quantification of contrastive behaviors for modeling networked anagram games
• An angel-daemon approach to assess the uncertainty in the power of a collectivity to act
• scientific article; zbMATH DE number 6678598 (Why is no real title available?)
• Web services and \textit{incerta spiriti}: a game theoretic approach to uncertainty
• Uncertainty in the cloud: an angel-daemon approach to modelling performance
• On the Complexity of Equilibria Problems in Angel-Daemon Games
• Modelling web-service uncertainty: the angel/daemon approach

Describes a project that uses

Uses Software

• Orc

This page was built for publication: Computational aspects of uncertainty profiles and angel-daemon games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2441541)