Faster scaling algorithms for network problems
SIAM Journal on Computing
AgentSpeak(L): BDI agents speak out in a logical computable language
MAAMAW '96 Proceedings of the 7th European workshop on Modelling autonomous agents in a multi-agent world : agents breaking away: agents breaking away
Program analysis: the abstract interpretation perspective
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Using Abstraction and Model Checking to Detect Safety Violations in Requirements Specifications
IEEE Transactions on Software Engineering
Computationally Manageable Combinational Auctions
Management Science
Logic in computer science: modelling and reasoning about systems
Logic in computer science: modelling and reasoning about systems
Bandera: extracting finite-state models from Java source code
Proceedings of the 22nd international conference on Software engineering
Computationally feasible VCG mechanisms
Proceedings of the 2nd ACM conference on Electronic commerce
Automating first-order relational logic
SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Some Tractable Combinatorial Auctions
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Model Checking Guided Abstraction and Analysis
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
State-Space Reduction Techniques in Agent Verification
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Combinatorial Auctions
Programming and Verifying Subgame-Perfect Mechanisms
Journal of Logic and Computation
Verifying Multi-agent Programs by Model Checking
Autonomous Agents and Multi-Agent Systems
Optimal decision-making with minimal waste: strategyproof redistribution of VCG payments
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Realising Common Knowledge Assumptions in Agent Auctions
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Abstractions for model-checking game-theoretic properties of auctions
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Verifying Dominant Strategy Equilibria in Auctions
CEEMAS '07 Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V
Dynamic verification of trust in distributed open systems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A qualitative comparison of the suitability of four theorem provers for basic auction theory
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Hi-index | 0.00 |
We are interested in finding algorithms which will allow an agent roaming between different electronic auction institutions to automatically verify the game-theoretic properties of a previously unseen auction protocol. A property may be that the protocol is robust to collusion or deception or that a given strategy is optimal. 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 considered two case studies: the Vickrey auction and a tractable combinatorial 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: the first is 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 range and number of agents.