---
_id: '11902'
abstract:
- lang: eng
  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."
article_processing_charge: No
article_type: original
author:
- first_name: Paul
  full_name: Dütting, Paul
  last_name: Dütting
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
- first_name: Ingmar
  full_name: Weber, Ingmar
  last_name: Weber
citation:
  ama: Dütting P, Henzinger M, 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., &#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>
  chicago: Dütting, Paul, Monika 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>.
  ieee: P. Dütting, M. Henzinger, and I. Weber, “Bidder optimal assignments for general
    utilities,” <i>Theoretical Computer Science</i>, vol. 478, no. 3. Elsevier, pp.
    22–32, 2013.
  ista: Dütting P, Henzinger M, 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>.
  short: P. Dütting, M. Henzinger, I. Weber, Theoretical Computer Science 478 (2013)
    22–32.
date_created: 2022-08-17T11:11:04Z
date_published: 2013-03-25T00:00:00Z
date_updated: 2024-11-06T12:24:12Z
day: '25'
doi: 10.1016/j.tcs.2013.01.030
extern: '1'
fulldoi: https://doi.org/10.1016/j.tcs.2013.01.030
intvolume: '       478'
issue: '3'
language:
- iso: eng
month: '03'
oa_version: None
page: 22-32
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
  record:
  - id: '11799'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Bidder optimal assignments for general utilities
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 478
year: '2013'
...