{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T10:29:34Z","timestamp":1768559374029,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,5]],"date-time":"2005-06-05T00:00:00Z","timestamp":1117929600000},"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":[[2005,6,5]]},"DOI":"10.1145\/1064009.1064032","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"213-222","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Towards truthful mechanisms for binary demand games"],"prefix":"10.1145","author":[{"given":"Ming-Yang","family":"Kao","sequence":"first","affiliation":[{"name":"Northwestern University, Evanston, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang-Yang","family":"Li","sequence":"additional","affiliation":[{"name":"Illinois Institute of Technology, Chicago, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"WeiZhao","family":"Wang","sequence":"additional","affiliation":[{"name":"Illinois Institute of Technology, Chicago, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"205","volume-title":"ACM-SIAM SODA","author":"Archer C.","year":"2003"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875583"},{"key":"e_1_3_2_1_3_1","unstructured":"Auletta V. Prisco R. D. Penna P. and Persiano P. Deterministic truthful approximation schemes for scheduling related machines.  Auletta V. Prisco R. D. Penna P. and Persiano P. Deterministic truthful approximation schemes for scheduling related machines."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Clarke E. H. Multipart pricing of public goods. Public Choice (1971) 17--33.  Clarke E. H. Multipart pricing of public goods. Public Choice (1971) 17--33.","DOI":"10.1007\/BF01726210"},{"key":"e_1_3_2_1_6_1","unstructured":"R. Muller and R. V. Vohra. On Dominant Strategy Mechanisms. Working paper 2003.  R. Muller and R. V. Vohra. On Dominant Strategy Mechanisms. Working paper 2003."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/779928.779942"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/501158.501190"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571856"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Green J. and Laffont J. J. Characterization of satisfactory mechanisms for the revelation of preferences for public goods. Econometrica (1977) 427--438.  Green J. and Laffont J. J. Characterization of satisfactory mechanisms for the revelation of preferences for public goods. Econometrica (1977) 427--438.","DOI":"10.2307\/1911219"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Groves T. Incentives in teams. Econometrica (1973) 617--631.  Groves T. Incentives in teams. Econometrica (1973) 617--631.","DOI":"10.2307\/1914085"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585266"},{"key":"e_1_3_2_1_13_1","first-page":"379","volume-title":"18th National Conference on Artificial intelligence","author":"Mu'alem A.","year":"2002"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301287"},{"key":"e_1_3_2_1_15_1","first-page":"329","volume-title":"Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Halperin","year":"2000"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-0208(08)73101-3"},{"key":"e_1_3_2_1_17_1","first-page":"770","volume-title":"Proceedings of the 11th annual ACM-SIAM SODA","author":"Robins G.","year":"2000"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"A. Zelikovsky. An 11\/6-approximation algorithm for the network Steiner problem. Algorithmica 9(5):463--470 1993.  A. Zelikovsky. An 11\/6-approximation algorithm for the network Steiner problem. Algorithmica 9(5):463--470 1993.","DOI":"10.1007\/BF01187035"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(83)90080-X"},{"key":"e_1_3_2_1_20_1","first-page":"573","article-title":"An approximate solution for the steiner problem in graphs","volume":"24","author":"Takahashi H.","year":"1980","journal-title":"Math. Japonica"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"},{"key":"e_1_3_2_1_22_1","article-title":"-Y. Truthful low-cost unicast in selfish wireless networks. In 4th","author":"Wang W.","year":"2005","journal-title":"IEEE Transactions on Mobile Computing ("},{"key":"e_1_3_2_1_23_1","volume-title":"IEEE INFOCOM","author":"Wang W.","year":"2005"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1023720.1023745"}],"event":{"name":"EC05: Sixth ACM Conference on Electronic Commerce 2005","location":"Vancouver BC Canada","acronym":"EC05","sponsor":["ACM Association for Computing Machinery","SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 6th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1064009.1064032","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1064009.1064032","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:50Z","timestamp":1750262870000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1064009.1064032"}},"subtitle":["a general framework"],"short-title":[],"issued":{"date-parts":[[2005,6,5]]},"references-count":24,"alternative-id":["10.1145\/1064009.1064032","10.1145\/1064009"],"URL":"https:\/\/doi.org\/10.1145\/1064009.1064032","relation":{},"subject":[],"published":{"date-parts":[[2005,6,5]]},"assertion":[{"value":"2005-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}