Bidder optimal assignments for general utilities

Paul Dütting, Monika Henzinger, Ingmar Weber

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

We study the problem of matching bidders to items where each bidder i has general, strictly monotonic utility functions ui,j(pj) expressing her 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. Furthermore, we give an algorithm to find such a solution. Although the running time of this algorithm is exponential in the number of items, it is polynomial in the number of bidders.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages575-582
Number of pages8
Volume5929 LNCS
DOIs
Publication statusPublished - 1 Dec 2009
Externally publishedYes
Event5th International Workshop on Internet and Network Economics, WINE 2009 - Rome, Italy
Duration: 14 Dec 200918 Dec 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5929 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th International Workshop on Internet and Network Economics, WINE 2009
CountryItaly
CityRome
Period14/12/0918/12/09

Fingerprint

Utility Function
Assignment
Monotonic Function
Strictly
Polynomials
Polynomial

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Dütting, P., Henzinger, M., & Weber, I. (2009). Bidder optimal assignments for general utilities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5929 LNCS, pp. 575-582). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5929 LNCS). https://doi.org/10.1007/978-3-642-10841-9_58

Bidder optimal assignments for general utilities. / Dütting, Paul; Henzinger, Monika; Weber, Ingmar.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5929 LNCS 2009. p. 575-582 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5929 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dütting, P, Henzinger, M & Weber, I 2009, Bidder optimal assignments for general utilities. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5929 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5929 LNCS, pp. 575-582, 5th International Workshop on Internet and Network Economics, WINE 2009, Rome, Italy, 14/12/09. https://doi.org/10.1007/978-3-642-10841-9_58
Dütting P, Henzinger M, Weber I. Bidder optimal assignments for general utilities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5929 LNCS. 2009. p. 575-582. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-10841-9_58
Dütting, Paul ; Henzinger, Monika ; Weber, Ingmar. / Bidder optimal assignments for general utilities. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5929 LNCS 2009. pp. 575-582 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ba8181edbdae4c649456eb9ad92e8f07,
title = "Bidder optimal assignments for general utilities",
abstract = "We study the problem of matching bidders to items where each bidder i has general, strictly monotonic utility functions ui,j(pj) expressing her 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. Furthermore, we give an algorithm to find such a solution. Although the running time of this algorithm is exponential in the number of items, it is polynomial in the number of bidders.",
author = "Paul D{\"u}tting and Monika Henzinger and Ingmar Weber",
year = "2009",
month = "12",
day = "1",
doi = "10.1007/978-3-642-10841-9_58",
language = "English",
isbn = "3642108407",
volume = "5929 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "575--582",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Bidder optimal assignments for general utilities

AU - Dütting, Paul

AU - Henzinger, Monika

AU - Weber, Ingmar

PY - 2009/12/1

Y1 - 2009/12/1

N2 - We study the problem of matching bidders to items where each bidder i has general, strictly monotonic utility functions ui,j(pj) expressing her 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. Furthermore, we give an algorithm to find such a solution. Although the running time of this algorithm is exponential in the number of items, it is polynomial in the number of bidders.

AB - We study the problem of matching bidders to items where each bidder i has general, strictly monotonic utility functions ui,j(pj) expressing her 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. Furthermore, we give an algorithm to find such a solution. Although the running time of this algorithm is exponential in the number of items, it is polynomial in the number of bidders.

UR - http://www.scopus.com/inward/record.url?scp=76649124926&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=76649124926&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-10841-9_58

DO - 10.1007/978-3-642-10841-9_58

M3 - Conference contribution

AN - SCOPUS:76649124926

SN - 3642108407

SN - 9783642108402

VL - 5929 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 575

EP - 582

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -