Abstracting and Verifying Strategy-Proofness for Auction Mechanisms

DOI10.1007/978-3-540-93920-7_13zbMath1207.68096OpenAlexW1796295358MaRDI QIDQ3601792

Emmanuel Tadjouddine, Frank Guerin, Wamberto W. Vasconcelos

Publication date: 12 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-93920-7_13

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Auctions, bargaining, bidding and selling, and other market models (91B26) Internet topics (68M11) Agent technology and artificial intelligence (68T42)

Related Items (1)

An introduction to mechanized reasoning

Uses Software

• SPIN
• AgentSpeak

Cites Work

• Computationally Manageable Combinational Auctions
• Programming and Verifying Subgame-Perfect Mechanisms
• Verifying Dominant Strategy Equilibria in Auctions
• Faster Scaling Algorithms for Network Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Abstracting and Verifying Strategy-Proofness for Auction Mechanisms