{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:48Z","timestamp":1750306728040,"version":"3.41.0"},"reference-count":9,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2014,11,25]],"date-time":"2014-11-25T00:00:00Z","timestamp":1416873600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGecom Exch."],"published-print":{"date-parts":[[2014,11,25]]},"abstract":"<jats:p>\n            We consider the one-sided matching problem, where agents must be matched to indivisible objects. Our first result is a novel characterization of strategyproof mechanisms by three intuitive axioms. Furthermore, we introduce\n            <jats:italic>partial strategyproofness<\/jats:italic>\n            , a new relaxation of strategyproofness that bridges the gap between full and weak strategyproofness. Partial strategyproofness finds application in the incentive analysis of non-strategyproof mechanisms, such as Probabilistic Serial, different variants of the Boston mechanism, and hybrid mechanisms. In this letter, we summarize the main results from [Mennle and Seuken 2014a] and demonstrate how they can be used for the design and analysis of matching mechanisms.\n          <\/jats:p>","DOI":"10.1145\/2692375.2692381","type":"journal-article","created":{"date-parts":[[2014,11,26]],"date-time":"2014-11-26T14:51:56Z","timestamp":1417013516000},"page":"64-67","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Relaxing strategyproofness in one-sided matching"],"prefix":"10.1145","volume":"13","author":[{"given":"Timo","family":"Mennle","sequence":"first","affiliation":[{"name":"University of Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Seuken","sequence":"additional","affiliation":[{"name":"University of Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,11,25]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1257\/000282803322157061"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Azevedo E. M. and Budish E. 2013. Strategyproofness in the Large as a Desideratum for Market Design. Working Paper.  Azevedo E. M. and Budish E. 2013. Strategyproofness in the Large as a Desideratum for Market Design. Working Paper.","DOI":"10.1145\/2229012.2229021"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.2000.2710"},{"key":"e_1_2_1_4_1","unstructured":"Featherstone C. R. 2011. A Rank-based Refinement of Ordinal Efficiency and a new (but Familiar) Class of Ordinal Assignment Mechanisms. Working Paper.  Featherstone C. R. 2011. A Rank-based Refinement of Ordinal Efficiency and a new (but Familiar) Class of Ordinal Assignment Mechanisms. Working Paper."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.3982\/TE1010"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Mennle T. and Seuken S. 2014a. An Axiomatic Approach to Characterizing and Relaxing Strategyproofness of One-sided Matching Mechanisms. Working Paper.  Mennle T. and Seuken S. 2014a. An Axiomatic Approach to Characterizing and Relaxing Strategyproofness of One-sided Matching Mechanisms. Working Paper.","DOI":"10.1145\/2600057.2602885"},{"volume-title":"Hybrid Mechanisms: Trading off Strategyproofness and Efficiency in One-Sided Matching. Working Paper.","year":"2014","author":"Mennle T.","key":"e_1_2_1_7_1"},{"key":"e_1_2_1_8_1","unstructured":"Mennle T. and Seuken S. 2014c. The Na\u00efve versus the Adaptive Boston Mechanism. Working Paper.  Mennle T. and Seuken S. 2014c. The Na\u00efve versus the Adaptive Boston Mechanism. Working Paper."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.103.1.80"}],"container-title":["ACM SIGecom Exchanges"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2692375.2692381","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2692375.2692381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:40Z","timestamp":1750231180000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2692375.2692381"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,25]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,11,25]]}},"alternative-id":["10.1145\/2692375.2692381"],"URL":"https:\/\/doi.org\/10.1145\/2692375.2692381","relation":{},"ISSN":["1551-9031"],"issn-type":[{"type":"electronic","value":"1551-9031"}],"subject":[],"published":{"date-parts":[[2014,11,25]]},"assertion":[{"value":"2014-11-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}