{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T20:47:48Z","timestamp":1774385268632,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,5,14]],"date-time":"2007-05-14T00:00:00Z","timestamp":1179100800000},"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":[[2007,5,14]]},"DOI":"10.1145\/1329125.1329365","type":"proceedings-article","created":{"date-parts":[[2008,1,18]],"date-time":"2008-01-18T15:04:38Z","timestamp":1200668678000},"page":"1-3","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Some results on approximating the minimax solution in approval voting"],"prefix":"10.1145","author":[{"given":"Rob","family":"LeGrand","sequence":"first","affiliation":[{"name":"Washington University, St. Louis, Missouri"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Markakis","sequence":"additional","affiliation":[{"name":"Center for Mathematics and Computer Science (CWI), Amsterdam, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aranyak","family":"Mehta","sequence":"additional","affiliation":[{"name":"IBM Almaden Research Center, San Jose, California"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,5,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Reasoned Choices: Essays in Honor of Hannu Nurmi","author":"Brams S. J.","year":"2004","unstructured":"S. J. Brams, D. M. Kilgour, and M. R. Sanver. A minimax procedure for negotiating multilateral treaties. In M. Wiberg, editor, Reasoned Choices: Essays in Honor of Hannu Nurmi. Finnish Political Science Association, 2004."},{"key":"e_1_3_2_1_2_1","volume-title":"A minimax procedure for electing committees. manuscript","author":"Brams S. J.","year":"2006","unstructured":"S. J. Brams, D. M. Kilgour, and M. R. Sanver. A minimax procedure for electing committees. manuscript, 2006."},{"key":"e_1_3_2_1_3_1","first-page":"173","volume-title":"AAAI","author":"Ephrati E.","year":"1991","unstructured":"E. Ephrati and J. Rosenschein. The clarke tax as a consensus mechanism among automated agents. In AAAI, pages 173--178, 1991."},{"key":"e_1_3_2_1_4_1","first-page":"423","volume-title":"IJCAI","author":"Ephrati E.","year":"1993","unstructured":"E. Ephrati and J. Rosenschein. multiagent planning as a dynamic search for social consensus. In IJCAI, pages 423--429, 1993."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02679443"},{"key":"e_1_3_2_1_6_1","volume-title":"SODA","author":"Gasieniec L.","year":"1999","unstructured":"L. Gasieniec, J. Jansson, and A. Lingas. Efficient approximation algorithms for the Hamming center problem. In SODA, 1999."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00057-9"},{"key":"e_1_3_2_1_8_1","unstructured":"R. LeGrand. Analysis of the minimax procedure. Technical Report WUCSE-2004-67 Department of Computer Science and Engineering Washington University St. Louis Missouri Nov. 2004."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301376"},{"key":"e_1_3_2_1_10_1","first-page":"729","volume-title":"AAAI","author":"Pennock D.","year":"2000","unstructured":"D. Pennock, E. Horvitz, and C. L. Giles. Social choice theory and recommender systems: Analysis of the axiomatic foundations of collaborative filtering. In AAAI, pages 729--734, 2000."}],"event":{"name":"AAMAS07: International Conference on Autonomous Agents and Mulitagent Systems","location":"Honolulu Hawaii","acronym":"AAMAS07","sponsor":["IFAAMAS"]},"container-title":["Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1329125.1329365","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1329125.1329365","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T17:21:05Z","timestamp":1774372865000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1329125.1329365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5,14]]},"references-count":10,"alternative-id":["10.1145\/1329125.1329365","10.1145\/1329125"],"URL":"https:\/\/doi.org\/10.1145\/1329125.1329365","relation":{},"subject":[],"published":{"date-parts":[[2007,5,14]]},"assertion":[{"value":"2007-05-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}