{"title":"A Measure of Complexity for Strategy-Proof Mechanisms","authors":"Lea Nagel, Roberto Saitto","doi":"10.1145/3580507.3597691","DOIUrl":null,"url":null,"abstract":"We propose a measure of strategic complexity for strategy-proof mechanisms. In particular, we characterize a class of implementations for which we provide a complete ranking in terms of their strategic complexity, in a well-defined sense. The class---which we call essential frames---includes virtually all strategy-proof mechanisms used in practice.","PeriodicalId":210555,"journal":{"name":"Proceedings of the 24th ACM Conference on Economics and Computation","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 24th ACM Conference on Economics and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3580507.3597691","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We propose a measure of strategic complexity for strategy-proof mechanisms. In particular, we characterize a class of implementations for which we provide a complete ranking in terms of their strategic complexity, in a well-defined sense. The class---which we call essential frames---includes virtually all strategy-proof mechanisms used in practice.