{"issue":"3","publication":"Theoretical Computer Science","publisher":"Elsevier","publication_status":"published","date_created":"2022-08-17T11:11:04Z","month":"03","extern":"1","_id":"11902","article_type":"original","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","date_updated":"2023-02-21T16:28:41Z","doi":"10.1016/j.tcs.2013.01.030","oa_version":"None","page":"22-32","language":[{"iso":"eng"}],"day":"25","author":[{"first_name":"Paul","last_name":"Dütting","full_name":"Dütting, Paul"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"full_name":"Weber, Ingmar","last_name":"Weber","first_name":"Ingmar"}],"year":"2013","abstract":[{"text":"We study the problem of matching bidders to items where each bidder i has general, strictly monotonic utility functions ui,j(pj) expressing his utility of being matched to item j at price pj. For this setting we prove that a bidder optimal outcome always exists, even when the utility functions are non-linear and non-continuous. We give sufficient conditions under\r\nwhich every mechanism that finds a bidder optimal outcome is incentive compatible. We also give a mechanism that finds a bidder optimal outcome if the conditions for incentive compatibility are satisfied. The running time of this mechanism is exponential in the number of items, but polynomial in the number of bidders.","lang":"eng"}],"scopus_import":"1","quality_controlled":"1","date_published":"2013-03-25T00:00:00Z","volume":478,"publication_identifier":{"issn":["0304-3975"]},"article_processing_charge":"No","title":"Bidder optimal assignments for general utilities","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"11799"}]},"citation":{"ista":"Dütting P, Henzinger MH, Weber I. 2013. Bidder optimal assignments for general utilities. Theoretical Computer Science. 478(3), 22–32.","mla":"Dütting, Paul, et al. “Bidder Optimal Assignments for General Utilities.” <i>Theoretical Computer Science</i>, vol. 478, no. 3, Elsevier, 2013, pp. 22–32, doi:<a href=\"https://doi.org/10.1016/j.tcs.2013.01.030\">10.1016/j.tcs.2013.01.030</a>.","chicago":"Dütting, Paul, Monika H Henzinger, and Ingmar Weber. “Bidder Optimal Assignments for General Utilities.” <i>Theoretical Computer Science</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.tcs.2013.01.030\">https://doi.org/10.1016/j.tcs.2013.01.030</a>.","ama":"Dütting P, Henzinger MH, Weber I. Bidder optimal assignments for general utilities. <i>Theoretical Computer Science</i>. 2013;478(3):22-32. doi:<a href=\"https://doi.org/10.1016/j.tcs.2013.01.030\">10.1016/j.tcs.2013.01.030</a>","apa":"Dütting, P., Henzinger, M. H., &#38; Weber, I. (2013). Bidder optimal assignments for general utilities. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2013.01.030\">https://doi.org/10.1016/j.tcs.2013.01.030</a>","short":"P. Dütting, M.H. Henzinger, I. Weber, Theoretical Computer Science 478 (2013) 22–32.","ieee":"P. Dütting, M. H. Henzinger, and I. Weber, “Bidder optimal assignments for general utilities,” <i>Theoretical Computer Science</i>, vol. 478, no. 3. Elsevier, pp. 22–32, 2013."},"intvolume":"       478"}