Dütting, Paul, Henzinger, Monika and Weber, Ingmar (2009) Bidder optimal assignments for general utilities. In: Leonardi, Stefano, (ed.) Proceedings of the 5th International Workshop on Internet and Network Economics. Lecture Notes in Computer Science (5929). Springer Berlin / Heidelberg, Berlin, Germany, pp. 575-582. ISBN 9783642108402
Full text not available from this repository.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.
| Item Type: | Book Section |
|---|---|
| Official URL: | https://link.springer.com/conference/wine |
| Additional Information: | © 2009 Springer |
| Divisions: | Mathematics |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Date Deposited: | 16 Nov 2017 16:51 |
| Last Modified: | 13 Sep 2024 17:07 |
| URI: | http://eprints.lse.ac.uk/id/eprint/85619 |
Actions (login required)
 |
View Item |
