{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T06:46:34Z","timestamp":1759041994113,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,11,16]],"date-time":"2017-11-16T00:00:00Z","timestamp":1510790400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["10971187"],"award-info":[{"award-number":["10971187"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["06446"],"award-info":[{"award-number":["06446"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11531014"],"award-info":[{"award-number":["11531014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10898-017-0586-x","type":"journal-article","created":{"date-parts":[[2017,11,16]],"date-time":"2017-11-16T04:10:57Z","timestamp":1510805457000},"page":"859-873","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain"],"prefix":"10.1007","volume":"70","author":[{"given":"Qiaoming","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yicheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,16]]},"reference":[{"issue":"4","key":"586_CR1","first-page":"328","volume":"58","author":"KJ Arrow","year":"1950","unstructured":"Arrow, K.J.: A difficulty in the concept of social welfare. J. Polit. Theory 58(4), 328\u2013346 (1950)","journal-title":"J. Polit. Theory"},{"key":"586_CR2","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1287\/moor.1100.0457","volume":"35","author":"N Alon","year":"2010","unstructured":"Alon, N., Feldman, M., Procaccia, A.D., Tennenholtz, M.: Strategyproof approximation of the minimax on networks. Math. Oper. Res. 35, 513\u2013526 (2010)","journal-title":"Math. Oper. Res."},{"unstructured":"An, M.Y.: Log-concave probability distributions: theory and statistical testing. Working Paper, Duke University (1995)","key":"586_CR3"},{"doi-asserted-by":"crossref","unstructured":"Ashlagi, I., Fischer, F., Kash, I., Procaccia, A.D.: Mix and match. In: Proceedings of ACM-EC, vol. 99, pp. 305\u2013314 (2010)","key":"586_CR4","DOI":"10.1145\/1807342.1807392"},{"issue":"5","key":"586_CR5","doi-asserted-by":"crossref","first-page":"1648","DOI":"10.1016\/j.jet.2010.03.006","volume":"145","author":"S Barber\u00e0","year":"2010","unstructured":"Barber\u00e0, S., Berga, D., Moreno, B.: Individual versus group strategy-proofness: when do they coincide? J. Econ. Theory 145(5), 1648\u20131674 (2010)","journal-title":"J. Econ. Theory"},{"issue":"4","key":"586_CR6","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1007\/s00182-011-0305-7","volume":"41","author":"S Barber\u00e0","year":"2012","unstructured":"Barber\u00e0, S., Berga, D., Moreno, B.: Group strategy-proof social choice functions with binary ranges and arbitrary domains: characterization results. Int. J. Game Theory 41(4), 791\u2013808 (2012)","journal-title":"Int. J. Game Theory"},{"issue":"2\u20133","key":"586_CR7","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s00355-011-0624-4","volume":"39","author":"S Barber\u00e0","year":"2012","unstructured":"Barber\u00e0, S., Berga, D., Moreno, B.: Domains, ranges and strategy-proofness: the case of single-dipped preferences. Soc. Choice Welf. 39(2\u20133), 335\u2013352 (2012)","journal-title":"Soc. Choice Welf."},{"key":"586_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"unstructured":"Brandt, F., Conitzer, V., Endriss, U.: Computational social choice. In: Weiss, G. (ed.) Multiagent Systems, pp. 213\u2013283. MIT Press, Cambridge (2012)","key":"586_CR9"},{"key":"586_CR10","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.tcs.2011.11.041","volume":"497","author":"Y Cheng","year":"2011","unstructured":"Cheng, Y., Yu, W., Zhang, G.: Strategy-proof approximation mechanisms for obnoxious facility game on networks. Theor. Comput. Sci. 497, 154\u2013163 (2011)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Dughmi, S., Ghosh, A.: Truthful assignment without money. In: Proceedings of ACM-EC, pp. 325\u2013334 (2010)","key":"586_CR11","DOI":"10.1145\/1807342.1807394"},{"key":"586_CR12","first-page":"587","volume":"41","author":"A Gibbard","year":"1973","unstructured":"Gibbard, A.: Manipulation of voting schemes: a general result. Econom. J. Econom. Soc. 41, 587\u2013601 (1973)","journal-title":"Econom. J. Econom. Soc."},{"issue":"4","key":"586_CR13","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1002\/bs.3830130405","volume":"13","author":"MB Garman","year":"1968","unstructured":"Garman, M.B., Kamien, M.I.: The paradox of voting: probability calculations. Syst. Res. Behav. Sci. 13(4), 306\u2013316 (1968)","journal-title":"Syst. Res. Behav. Sci."},{"unstructured":"Guo, M., Conitzer, V.: Strategy-proof allocation of multiple items between two agents without payments or priors. In: Proceedings of AAMAS, pp. 881\u2013888 (2010)","key":"586_CR14"},{"doi-asserted-by":"crossref","unstructured":"Guo, M., Conitzer, V., Reeves, D.: Competitive repeated allocation without payments. In: Proceedings of WINE, pp. 244\u2013255 (2010)","key":"586_CR15","DOI":"10.1007\/978-3-642-10841-9_23"},{"key":"586_CR16","volume-title":"Public Sector Economics: The Role of Government in the American Economy","author":"RG Holcombe","year":"2006","unstructured":"Holcombe, R.G.: Public Sector Economics: The Role of Government in the American Economy. Prentice Hall, Upper Saddle River (2006)"},{"doi-asserted-by":"crossref","unstructured":"Harrenstein, P., de Weerdt, M.M., Conitzer, V.: A qualitative Vickrey auction. In: Proceedings of ACM-EC, pp. 197\u2013206 (2009)","key":"586_CR17","DOI":"10.1145\/1566374.1566403"},{"doi-asserted-by":"crossref","unstructured":"Ibara, K., Nagamochi, H.: Characterizing mechanisms in obnoxious facility game. Working Paper, Kyoto University (2012)","key":"586_CR18","DOI":"10.1007\/978-3-642-31770-5_27"},{"issue":"3","key":"586_CR19","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0165-1765(97)00097-9","volume":"55","author":"B Klaus","year":"1997","unstructured":"Klaus, B., Petters, H., Storchen, T.: Strategy-proof division of a private good when preferences are single-dipped. Econ.Lett. 55(3), 339\u2013346 (1997)","journal-title":"Econ.Lett."},{"doi-asserted-by":"crossref","unstructured":"Lu, P., Sun, X., Wang, Y., Zhu, Z.A.: Asymptotically optimal strategy-proof mechanisms for two-facility games. In: Proceedings of AMC-EC, pp. 315\u2013324 (2010)","key":"586_CR20","DOI":"10.1145\/1807342.1807393"},{"doi-asserted-by":"crossref","unstructured":"Lu, P., Wang, Y., Zhou, Y.: Tighter bounds for facility games. In: Proceedings of WINE, pp. 137\u2013148 (2009)","key":"586_CR21","DOI":"10.1007\/978-3-642-10841-9_14"},{"key":"586_CR22","first-page":"680","volume":"20","author":"KO May","year":"1952","unstructured":"May, K.O.: A set of independent necessary and sufficient conditions for simple majority decision. Econom. J. Econom. Soc. 20, 680\u2013684 (1952)","journal-title":"Econom. J. Econom. Soc."},{"key":"586_CR23","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/s00182-013-0396-4","volume":"43","author":"V Manjunath","year":"2010","unstructured":"Manjunath, V.: Efficient and strategy-proof social choice when preferences are single-dipped. Int. J. Game Theory 43, 579\u2013597 (2010)","journal-title":"Int. J. Game Theory"},{"key":"586_CR24","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.mathsocsci.2012.02.003","volume":"63","author":"V Manjunath","year":"2011","unstructured":"Manjunath, V.: Group strategy-proofness and social choice between two alternatives. Math. Soc. Sci. 63, 239\u2013242 (2011)","journal-title":"Math. Soc. Sci."},{"unstructured":"Meir, R., Almagor, S., Michaely, A., Rosenschein, J.S.: Tight bounds for strategyproof classification. In: Proceedings of AAMAS, pp. 319\u2013326 (2011)","key":"586_CR25"},{"unstructured":"Meir, R., Procaccia, A.D., Rosenschein, J.S.: Strategyproof classification with shared inputs. In: Proceedings of IJCAI. 220\u2013225 (2009)","key":"586_CR26"},{"unstructured":"Meir, R., Procaccia, A.D., Rosenschein, J.S.: On the limits of dictatorial classification. In: Proceedings of AAMAS, pp. 609\u2013616 (2010)","key":"586_CR27"},{"issue":"40","key":"586_CR28","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF00128122","volume":"35","author":"H Moulin","year":"1980","unstructured":"Moulin, H.: On strategy-proofness and single peakedness. Pub. Choice 35(40), 437\u2013455 (1980)","journal-title":"Pub. Choice"},{"key":"586_CR29","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1017\/CBO9780511800481.011","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N.: Introduction to mechanism design (for computer scuentists). In: Nisan, N., Roughgarden, T., Tard\u00f6s, E., Vazirani, V.V. (eds.) Algorithmic Game Theory, pp. 209\u2013241. Cambridge University Press, Cambridge (2007)"},{"unstructured":"Othman, A., Budish, E., Sandholm, T.: Finding approximate competitive equilibria: Efficient and fair course allocation. In: Proceedings of AAMAS, pp. 873\u2013880 (2010)","key":"586_CR30"},{"unstructured":"Peremans, W., Storcken, T.: Strategy-proofness on the single-dipped preference domain. In: Proceedings of ICLP, pp. 296\u2013313 (1999)","key":"586_CR31"},{"doi-asserted-by":"crossref","unstructured":"Peters, D., Lackner, M.: Preferences Single-Peaked on a Circle. AAAI. (2017)","key":"586_CR32","DOI":"10.1609\/aaai.v31i1.10615"},{"doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. In: Proceedings of ACM-EC, pp. 177\u2013186 (2009)","key":"586_CR33","DOI":"10.1145\/1566374.1566401"},{"issue":"2","key":"586_CR34","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0022-0531(75)90050-2","volume":"10","author":"MA Satterthwaite","year":"1975","unstructured":"Satterthwaite, M.A.: Strategy-proofness and arrow\u2019s conditions: existence and correspondence theorems for voting procedures and social welfare functions. J. Econ. Theory 10(2), 187\u2013217 (1975)","journal-title":"J. Econ. Theory"},{"key":"586_CR35","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1017\/CBO9780511800481.012","volume-title":"Algorithmic Game Theory","author":"J Schmmer","year":"2007","unstructured":"Schmmer, J., Vohra, R.: Mechanism design without money. In: Nisan, N., Roughgarden, T., Tard\u00f6s, E., Vazirani, V.V. (eds.) Algorithmic Game Theory, pp. 243\u2013264. Cambridge University Press, Cambridge (2007)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0586-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0586-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0586-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,7]],"date-time":"2022-08-07T11:59:03Z","timestamp":1659873543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0586-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,16]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["586"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0586-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2017,11,16]]}}}