{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T04:00:32Z","timestamp":1768622432386,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,4]],"date-time":"2012-06-04T00:00:00Z","timestamp":1338768000000},"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":[],"published-print":{"date-parts":[[2012,6,4]]},"DOI":"10.1145\/2229012.2229045","type":"proceedings-article","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T17:35:37Z","timestamp":1338917737000},"page":"423-440","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["Mechanism design on discrete lines and cycles"],"prefix":"10.1145","author":[{"given":"Elad","family":"Dokow","sequence":"first","affiliation":[{"name":"Bar-Ilan University and Carlos III de Madrid, Ramat Gan, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Feldman","sequence":"additional","affiliation":[{"name":"Harvard university, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reshef","family":"Meir","sequence":"additional","affiliation":[{"name":"Hebrew university, Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilan","family":"Nehama","sequence":"additional","affiliation":[{"name":"Hebrew university, Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"A. Examples of strategyproof mechanism in a tabular format. Available at: http:\/\/www.cs.huji.ac.il\/~reshef24\/JA_files\/file_list.html.  A. Examples of strategyproof mechanism in a tabular format. Available at: http:\/\/www.cs.huji.ac.il\/~reshef24\/JA_files\/file_list.html."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0457"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807392"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01832918"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2307\/2938220"},{"key":"e_1_3_2_1_6_1","volume-title":"The theory of committees and elections","author":"BLACK D.","unstructured":"BLACK , D. 1957 (reprint at 1986). The theory of committees and elections . Kluwer Academic Publishers . BLACK, D. 1957 (reprint at 1986). The theory of committees and elections. Kluwer Academic Publishers."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2307\/2296962"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.03.003"},{"key":"e_1_3_2_1_9_1","volume-title":"Maastricht : METEOR","author":"DIETRICH F.","unstructured":"DIETRICH , F. 2007. Aggregation and the relevance of some issues for others. Research Memoranda 002 , Maastricht : METEOR , Maastricht Research School of Economics of Technology and Organization . DIETRICH, F. 2007. Aggregation and the relevance of some issues for others. Research Memoranda 002, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00355-006-0196-x"},{"key":"e_1_3_2_1_11_1","unstructured":"DIETRICH F. AND LIST C. 2007b. Strategy-proof judgment aggregation. Open Access publications from London School of Economics and Political Science http:\/\/eprints.lse.ac.uk\/ London School of Economics and Political Science.  DIETRICH F. AND LIST C. 2007b. Strategy-proof judgment aggregation. Open Access publications from London School of Economics and Political Science http:\/\/eprints.lse.ac.uk\/ London School of Economics and Political Science."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807394"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2307\/1911681"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914085"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. of 9th AAMAS. 881--888","author":"GUO M.","year":"2010","unstructured":"GUO , M. AND CONITZER , V. 2010 . Strategy-proof allocation of multiple items between two agents without payments or priors . In Proc. of 9th AAMAS. 881--888 . GUO, M. AND CONITZER, V. 2010. Strategy-proof allocation of multiple items between two agents without payments or priors. In Proc. of 9th AAMAS. 881--888."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_23"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566403"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(77)90019-9"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807393"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_14"},{"key":"e_1_3_2_1_21_1","volume-title":"Proc. of 10th AAMAS. 319--326","author":"MEIR R.","year":"2011","unstructured":"MEIR , R. , ALMAGOR , S. , MICHAELY , A. , AND ROSENSCHEIN , J. S. 2011 . Tight bounds for strategyproof classification . In Proc. of 10th AAMAS. 319--326 . MEIR, R., ALMAGOR, S., MICHAELY, A., AND ROSENSCHEIN, J. S. 2011. Tight bounds for strategyproof classification. In Proc. of 10th AAMAS. 319--326."},{"key":"e_1_3_2_1_22_1","volume-title":"Proc. of 9th AAMAS. 609--616","author":"MEIR R.","year":"2010","unstructured":"MEIR , R. , PROCACCIA , A. D. , AND ROSENSCHEIN , J. S. 2010 . On the limits of dictatorial classification . In Proc. of 9th AAMAS. 609--616 . MEIR, R., PROCACCIA, A. D., AND ROSENSCHEIN, J. S. 2010. On the limits of dictatorial classification. In Proc. of 9th AAMAS. 609--616."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.03.008"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00128122"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2006.04.008"},{"key":"e_1_3_2_1_26_1","volume-title":"Proc. of 9th AAMAS. 873--880","author":"OTHMAN A.","year":"2010","unstructured":"OTHMAN , A. , BUDISH , E. , AND SANDHOLM , T. 2010 . Finding approximate competitive equilibria: Efficient and fair course allocation . In Proc. of 9th AAMAS. 873--880 . OTHMAN, A., BUDISH, E., AND SANDHOLM, T. 2010. Finding approximate competitive equilibria: Efficient and fair course allocation. In Proc. of 9th AAMAS. 873--880."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566401"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.2001.2807"},{"key":"e_1_3_2_1_29_1","volume-title":"Cambridge","author":"SCHUMMER J.","unstructured":"SCHUMMER , J. AND VOHRA , R. V. 2007. Mechanism design without money . In Algorithmic Game Theory, N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, Eds. Cambridge University Press , Chapter 10. SCHUMMER, J. AND VOHRA, R. V. 2007. Mechanism design without money. In Algorithmic Game Theory, N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, Eds. Cambridge University Press, Chapter 10."},{"key":"e_1_3_2_1_30_1","volume-title":"Department of Economics","author":"SVENSSON L.-G.","unstructured":"SVENSSON , L.-G. 1999. The proof of the Gibbard-Satterthwaite theorem revisited. Working Paper No. 1999:1 , Department of Economics , Lund University . Available at: http:\/\/www.nek.lu.se\/NEKlgs\/vote09.pdf. SVENSSON, L.-G. 1999. The proof of the Gibbard-Satterthwaite theorem revisited. Working Paper No. 1999:1, Department of Economics, Lund University. Available at: http:\/\/www.nek.lu.se\/NEKlgs\/vote09.pdf."}],"event":{"name":"EC '12: ACM Conference on Electronic Commerce","location":"Valencia Spain","acronym":"EC '12","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 13th ACM Conference on Electronic Commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2229012.2229045","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2229012.2229045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:59Z","timestamp":1750236539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2229012.2229045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,4]]},"references-count":30,"alternative-id":["10.1145\/2229012.2229045","10.1145\/2229012"],"URL":"https:\/\/doi.org\/10.1145\/2229012.2229045","relation":{},"subject":[],"published":{"date-parts":[[2012,6,4]]},"assertion":[{"value":"2012-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}