Verifying Dominant Strategy Equilibria in Auctions

Future agent mediated eCommerce will involve open systems of agents interoperating between different institutions, where different auction protocols may be in use. We argue that in order to achieve this agents will need a method to automatically verify the properties of a previously unseen auction protocol; for example, they may wish to verify that it is fair and robust to deception. We are therefore interested in the problem of automatically verifying the game-theoretic properties of a given auction mechanism, especially the property of strategyproofness. In this paper we show how the Alloy model checker can be used to automatically verify such properties. We illustrate the approach via two examples: a simple two player Vickrey auction and a quantity restricted multi-unit auction using the Vickrey-Clarke-Groves mechanism.

[1]  Tuomas Sandholm,et al.  An algorithm for optimal winner determination in combinatorial auctions , 1999, IJCAI 1999.

[2]  Noam Nisan,et al.  Bidding and allocation in combinatorial auctions , 2000, EC '00.

[3]  Avi Pfeffer,et al.  Representations and Solutions for Game-Theoretic Problems , 1997, Artif. Intell..

[4]  Daniel Jackson,et al.  Alloy: a lightweight object modelling notation , 2002, TSEM.

[5]  Paul Milgrom,et al.  Putting Auction Theory to Work , 2004 .

[6]  Frank Guerin,et al.  Applying game theory mechanisms in open agent systems with complete information , 2007, Autonomous Agents and Multi-Agent Systems.

[7]  Zohar Manna,et al.  Temporal Verification of Reactive Systems , 1995, Springer New York.

[8]  Ruggiero Cavallo,et al.  Optimal decision-making with minimal waste: strategyproof redistribution of VCG payments , 2006, AAMAS '06.

[9]  Moshe Tennenholtz Some Tractable Combinatorial Auctions , 2000, AAAI/IAAI.

[10]  Nicholas R. Jennings,et al.  Computational-Mechanism Design: A Call to Arms , 2003, IEEE Intell. Syst..

[11]  Robert Gibbons,et al.  A primer in game theory , 1992 .

[12]  Yoav Shoham,et al.  Combinatorial Auctions , 2005, Encyclopedia of Wireless Networks.

[13]  Daniel Jackson Automating first-order relational logic , 2000, SIGSOFT '00/FSE-8.

[14]  Michael Huth Logic In Computer Science , 1999 .

[15]  Ulrich Endriss,et al.  Bidding Languages and Winner Determination for Mixed Multi-unit Combinatorial Auctions , 2007, EUMAS.

[16]  Ronald M. Harstad,et al.  Computationally Manageable Combinational Auctions , 1998 .

[17]  Marc Pauly,et al.  Programming and Verifying Subgame-Perfect Mechanisms , 2002, J. Log. Comput..

[18]  Zohar Manna,et al.  Temporal verification of reactive systems - safety , 1995 .

[19]  Michael Thielscher,et al.  General Game Playing , 2015 .

[20]  Derek Rayside,et al.  Automating commutativity analysis at the design level , 2004, ISSTA '04.

[21]  David Levine,et al.  Winner determination in combinatorial auction generalizations , 2002, AAMAS '02.

[22]  W. K. Vickery,et al.  Counter-Speculation Auctions and Competitive Sealed Tenders , 1961 .

[23]  Frank Guerin,et al.  Realising Common Knowledge Assumptions in Agent Auctions , 2006, 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology.

[24]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[25]  David C. Parkes,et al.  Auction design with costly preference elicitation , 2005, Annals of Mathematics and Artificial Intelligence.

[26]  Lawrence M. Ausubel,et al.  The Lovely but Lonely Vickrey Auction , 2004 .

[27]  Wiebe van der Hoek,et al.  Knowledge, Rationality and Action , 2004, AAMAS.

[28]  E. H. Clarke Multipart pricing of public goods , 1971 .

[29]  Frank Guerin,et al.  Verifying Equilibria in Games of Complete and Perfect Information Represented by Presburger Formulas , 2006 .

[30]  Mark Ryan,et al.  Logic in Computer Science: Modelling and Reasoning about Systems , 2000 .

[31]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[32]  Vincent Conitzer,et al.  Incremental Mechanism Design , 2007, IJCAI.

[33]  Frank Guerin An Algorithmic Approach to Specifying and Verifying Subgame Perfect Equilibria , 2006 .