Abstract
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 Spinmodel 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Guerin, F., Tadjouddine, E.M.: Realising common knowledge assumptions in agent auctions. In: The IEEE/WIC/ACM Int’l Conf. on Intelligent Agent Technology, Hong Kong, China, pp. 579–586 (2006)
Bordini, R.H., Fisher, M., Visser, W., Wooldridge, M.: State-space Reduction Techniques in Agent Verification. In: AAMAS 2004, pp. 896–903. ACM Press, New York (2004)
Tadjouddine, E.M., Guerin, F., Vasconcelos, W.: Abstractions for model checking game-theoretic properties in auctions. In: AAMAS (accepted, 2008)
Tennenholtz, M.: Some tractable combinatorial auctions. In: AAAI, pp. 98–103 (2000)
Holzmann, G.J.: The SPIN Model checker: Primer and Reference Manual. Addison, Boston (2004)
Tip, F.: A Survey of Program Slicing Techniques. Journal of Progr. Lang. 3, 121–189 (1995)
Cramton, P., Shoham, Y., Steinberg, R.: Combinatorial Auctions. MIT Press, Cambridge (2006)
Cavallo, R.: Optimal decision-making with minimal waste: strategyproof redistribution of VCG payments. In: AAMAS, pp. 882–889 (2006)
Nisan, N., Ronen, A.: Computationally feasible VCG mechanisms. In: ACM Conference on Electronic Commerce, pp. 242–252 (2000)
Rothkopf, M.H., Pekec, A., Harstad, R.M.: Computationally manageable combinatorial auctions. Management Science 44, 1131–1147 (1998)
Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for network problems. SIAM J. Comput. 18, 1013–1036 (1989)
Tadjouddine, E.M., Guerin, F.: Verifying dominant strategy equilibria in auctions. In: Burkhard, H.-D., Lindemann, G., Verbrugge, R., Varga, L.Z. (eds.) CEEMAS 2007. LNCS, vol. 4696, pp. 288–297. Springer, Heidelberg (2007)
Jackson, D.: Automating first-order relational logic. In: SIGSOFT FSE, pp. 130–139 (2000)
Taha, H.A.: Operations Research: An Introduction, 6th edn. Prentice-Hall, Englewood Cliffs (1997)
Cousot, P.: Program Analysis: The Abstract Interpretation Perspective. ACM Computing Surveys 28, 165 (1996)
Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: The Fourth Annual ACM SIGPLAN-SIGACT Symposium on POPL, Los Angeles, California, pp. 238–252. ACM Press, New York (1977)
Pasareanu, C.S., Dwyer, M.B., Visser, W.: Finding feasible abstract counter-examples. Soft. Tools for Tech. Transfer 5, 34–48 (2003)
Saïdi, H.: Model checking guided abstraction and analysis. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol. 1824, pp. 377–396. Springer, Heidelberg (2000)
Bordini, R.H., Fisher, M., Visser, W., Wooldridge, M.: Verifying Multi-Agent Programs by Model Checking. Autonomous Agents and Multi-Agent Systems 12, 239–256 (2006)
Rao, A.S.: AgentSpeak(L): BDI Agents Speak Out in a Logical Computable Language. In: Perram, J., Van de Velde, W. (eds.) MAAMAW 1996. LNCS, vol. 1038, pp. 42–55. Springer, Heidelberg (1996)
Visser, W., Havelund, K., Brat, G., Park, S.J.: Model checking programs. In: Proc. of the 15th IEEE International Conf. on Automated Software Engineering (2000)
Pauly, M.: Programming and verifying subgame-perfect mechanisms. J. Log. Comput. 15, 295–316 (2005)
Pauly, M., Wooldridge, M.: Logic for mechanism design—a manifesto. In: GTDT 2003 workshop, Hakodate, Japan, AAMAS 2003 (2003)
Osman, N., Robertson, D.: Dynamic verification of trust in distributed open systems. In: IJCAI, pp. 1440–1445 (2007)
Huth, M.R.A., Ryan, M.D.: Logic in Computer Science: Modelling and Reasoning about Systems. Cambridge University Press, Cambridge (2000)
Heitmeyer, C., Kirby, J., Labaw, B., Archer, M., Bharadwaj, R.: Using abstraction and model checking to detect safety violations in requirements specifications. IEEE Transactions on Software Engineering 24, 927–948 (1998)
Corbett, J.C., Dwyer, M.B., Hatcliff, J., Laubach, S., Păsăreanu, C.S., Zheng, H.: Bandera. In: Proceedings of the 22nd International Conference on Software Engineering, pp. 439–448. ACM Press, New York (2000)
Holzmann, G.J.: Personal communication (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tadjouddine, E.M., Guerin, F., Vasconcelos, W. (2009). Abstracting and Verifying Strategy-Proofness for Auction Mechanisms. In: Baldoni, M., Son, T.C., van Riemsdijk, M.B., Winikoff, M. (eds) Declarative Agent Languages and Technologies VI. DALT 2008. Lecture Notes in Computer Science(), vol 5397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-93920-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-93920-7_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-93919-1
Online ISBN: 978-3-540-93920-7
eBook Packages: Computer ScienceComputer Science (R0)