License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-11534
URL: http://drops.dagstuhl.de/opus/volltexte/2007/1153/
Go to the corresponding Portal


Balcan, Maria-Florina

Item Pricing for Revenue Maximization in Combinatorial Auctions

pdf-format:
Document 1.pdf (96 KB)


Abstract

Consider the problem of a retailer with various goods for sale, attempting to set prices to maximize revenue. If customers have separate valuations over the different goods, and these are known to the retailer, then the goods can be priced separately and the problem is not so difficult. However, when customers have valuations over sets of items, this becomes a combinatorial auction problem, and the problem becomes computationally hard even when valuations are fully known in advance. In this talk we present some simple randomized algorithms and mechanisms for a number of interesting cases of this problem, both in the limited and unlimited supply setting. This talk is based on joint work with Avrim Blum and Yishay Mansour.

BibTeX - Entry

@InProceedings{balcan:DSP:2007:1153,
  author =	{Maria-Florina Balcan},
  title =	{Item Pricing for Revenue Maximization in Combinatorial Auctions},
  booktitle =	{Computational Social Systems and the Internet},
  year =	{2007},
  editor =	{Peter Cramton and Rudolf M{\"u}ller and Eva Tardos and Moshe Tennenholtz },
  number =	{07271},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2007/1153},
  annote =	{Keywords: Item Pricing,  Revenue Maximizing, Combinatorial Auctions}
}

Keywords: Item Pricing, Revenue Maximizing, Combinatorial Auctions
Seminar: 07271 - Computational Social Systems and the Internet
Issue Date: 2007
Date of publication: 02.10.2007


DROPS-Home | Fulltext Search | Imprint Published by LZI