When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.07271.8
URN: urn:nbn:de:0030-drops-11534
Go to the corresponding Portal

Balcan, Maria-Florina

Item Pricing for Revenue Maximization in Combinatorial Auctions

07271.BalcanMariaFlorina.ExtAbstract.1153.pdf (0.09 MB)


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

  author =	{Balcan, Maria-Florina},
  title =	{{Item Pricing for Revenue Maximization in Combinatorial Auctions}},
  booktitle =	{Computational Social Systems and the Internet},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7271},
  editor =	{Peter Cramton and Rudolf M\"{u}ller and Eva Tardos and Moshe Tennenholtz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-11534},
  doi =		{10.4230/DagSemProc.07271.8},
  annote =	{Keywords: Item Pricing, Revenue Maximizing, Combinatorial Auctions}

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

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI