Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Synthesis of fault-tolerant concurrent programs
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Model checking
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Logic of Belief and a Model Checking Algorithm for Security Protocols
FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
Model Checking Game Properties of Multi-agent Systems (Abstract)
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Pushdown Processes: Games and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Realizability and Synthesis of Reactive Modules
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Automatic Synthesis of Controllers from Formal Specifications
ICFEM '98 Proceedings of the Second IEEE International Conference on Formal Engineering Methods
Automated analysis of cryptographic protocols using Mur/spl phi/
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Preserving peer replicas by rate-limited sampled voting
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Samsara: honor among thieves in peer-to-peer storage
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Quantitative solution of omega-regular games
Journal of Computer and System Sciences - STOC 2001
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Mechanism design for policy routing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Specification faithfulness in networks with rational nodes
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Verification of Multiagent Systems via Unbounded Model Checking
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
Model checking knowledge, strategies, and games in multi-agent systems
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
A cooperative internet backup scheme
ATEC '03 Proceedings of the annual conference on USENIX Annual Technical Conference
Progress in approximate nash equilibria
Proceedings of the 8th ACM conference on Electronic commerce
Sustaining cooperation in multi-hop wireless networks
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Finite-state analysis of SSL 3.0
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
Convergence to approximate Nash equilibria in congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Security and Cooperation in Wireless Networks: Thwarting Malicious and Selfish Behavior in the Age of Ubiquitous Computing
Automated Game Analysis via Probabilistic Model Checking: a case study
Electronic Notes in Theoretical Computer Science (ENTCS)
Model Checking Coalition Nash Equilibria in MAD Distributed Systems
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Hi-index | 0.00 |
We present a symbolic model checking algorithm for verification of Nash equilibria in finite state mechanisms modeling Multiple Administrative Domains (MAD) distributed systems. Given a finite state mechanism, a proposed protocol for each agent and an indifference threshold for rewards, our model checker returns PASS if the proposed protocol is a Nash equilibrium (up to the given indifference threshold) for the given mechanism, FAIL otherwise. We implemented our model checking algorithm inside the NuSMV model checker and present experimental results showing its effectiveness for moderate size mechanisms.