Passive Verification of the Strategyproofness of Mechanisms in Open Environments
MetadataShow full item record
CitationKang, Laura, and David C Parkes. 2006. Passive verification of the strategyproofness of mechanisms in open environments. In Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet: August 13-16, 2006, Fredericton, New Brunswick, Canada, ed. B. Spencer, 19-30. New York, NY: ACM Press.
AbstractConsider an open infrastructure in which anyone can deploy mechanisms to support automated decision making and coordination amongst self-interested computational agents. Strategyproofness is a central property in the design of such mechanisms, allowing participants to maximize their individual benefit by reporting truthful private information about preferences and capabilities and without modeling or reasoning about the behavior of other agents. But, why should participants trust that a mechanism is strategyproof? We address this problem, proposing and describing a passive verifier, able to monitor the inputs and outputs of mechanisms and verify the strategyproofness, or not, of a mechanism. Useful guarantees are available to participants before the behavior of the mechanism is completely known, and metrics are introduced to provide a measure of partial verification. Experimental results demonstrate the effectiveness of our method.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:4039775
- FAS Scholarly Articles 
Contact administrator regarding this item (to report mistakes or request changes)