A new fault-tolerant algorithm for clock synchronization
Information and Computation
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Fundamentals of fault-tolerant distributed computing in asynchronous environments
ACM Computing Surveys (CSUR)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Stackelberg scheduling strategies
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A game-theoretic classification of interactive complexity classes
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
The circuit value problem is log space complete for P
ACM SIGACT News
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Broadcast in radio networks tolerating byzantine adversarial behavior
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A Programming Model for the Orchestration of Web Services
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Distributed Computing
On the Complexity of Succinct Zero-Sum Games
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
The computational complexity of nash equilibria in concisely represented games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Equilibria for networks with malicious users
Mathematical Programming: Series A and B
Algorithmic Game Theory
Computing correlated equilibria in multi-player games
Journal of the ACM (JACM)
Theoretical Computer Science
The Price of Malice in Linear Congestion Games
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Settling the complexity of computing two-player Nash equilibria
Journal of the ACM (JACM)
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Pure Nash equilibria: hard and easy games
Journal of Artificial Intelligence Research
The Complexity of Computing a Nash Equilibrium
SIAM Journal on Computing
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Evaluating quality of web services: a risk-driven approach
BIS'07 Proceedings of the 10th international conference on Business information systems
Weighted Boolean formula games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Applying Bargaining Game Theory to Web Services Negotiation
SCC '10 Proceedings of the 2010 IEEE International Conference on Services Computing
Uncertainty in interdependent security games
GameSec'10 Proceedings of the First international conference on Decision and game theory for security
A game theoretic formulation of the service provisioning problem in cloud systems
Proceedings of the 20th international conference on World wide web
Resource and Revenue Sharing with Coalition Formation of Cloud Providers: Game Theoretic Approach
CCGRID '11 Proceedings of the 2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing
Equilibria problems on games: Complexity versus succinctness
Journal of Computer and System Sciences
Web services and incerta spiriti: a game theoretic approach to uncertainty
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
The complexity of game isomorphism
Theoretical Computer Science
Graphical models for game theory
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
A qos-aware selection model for semantic web services
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
QoS-Driven web service composition with inter service conflicts
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
Orchestrating unreliable services: strategic and probabilistic approaches to reliability
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
Coalition-Based Cooperative Packet Delivery under Uncertainty: A Dynamic Bayesian Coalitional Game
IEEE Transactions on Mobile Computing
Coalitional Game for Community-Based Autonomous Web Services Cooperation
IEEE Transactions on Services Computing
| Hi-index | 0.00 |
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called angel-daemon games. Those games were introduced to asses the performance of the execution of a web orchestration on a moderate faulty or under stress environment. Angel-daemon games are a natural example of zero-sum games whose representation is naturally succinct. We show that the problems of deciding the existence of a pure Nash equilibrium or of a dominant strategy for a given player are ${\Sigma}^{p}_{2}$-complete. Furthermore, computing the value of an angel-daemon game is EXP-complete. Thus, our results match the already known classification of the corresponding problems for the generic families of succinctly represented games with exponential number of actions.