POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Model Checking Guided Abstraction and Analysis
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
Computational-Mechanism Design: A Call to Arms
IEEE Intelligent Systems
Realising Common Knowledge Assumptions in Agent Auctions
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
Declarative Agent Languages and Technologies VI
Hi-index | 0.00 |
We are interested in verifying game-theoretic properties such as strategyproofness for auction protocols in open agent systems. Model checking provides an automatic way of carrying out such proofs. However it may suffer from state space explosion for large models. To improve the performance of model checking, abstractions were used along with the SPIN model checker. We applied the technique to the Vickrey auction. Numerical results showed the limits of relying solely on SPIN. To reduce the state space required by SPIN, two property-preserving abstraction methods were applied: firstly the classical program slicing technique, which removes irrelevant variables with respect to the property; the second replaces large data, possibly infinite values of variables, with smaller abstract values. This enabled us to model check the strategy-proofness property of the Vickrey auction for unbounded bid ranges and for any number of agents.