@inproceedings{11799,
  abstract     = {We study the problem of matching bidders to items where each bidder i has general, strictly monotonic utility functions u i,j (p j ) expressing her utility of being matched to item j at price p j . 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       = {Dütting, Paul and Henzinger, Monika H and Weber, Ingmar},
  booktitle    = {5th International Workshop on Internet and Network Economics},
  isbn         = {9783642108402},
  issn         = {1611-3349},
  location     = {Rome, Italy},
  pages        = {575--582},
  publisher    = {Springer Nature},
  title        = {{Bidder optimal assignments for general utilities}},
  doi          = {10.1007/978-3-642-10841-9_58},
  volume       = {5929},
  year         = {2009},
}