License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.10101.3
URN: urn:nbn:de:0030-drops-25621
Go to the corresponding Portal

Yokoo, Makoto

False-name-Proof Combinatorial Auction Mechanisms

10101.YokooMakoto.ExtAbstract.2562.pdf (0.09 MB)


In Internet auctions, it is easy for a bidder to submit multiple bids
under multiple identifiers (e.g., multiple e-mail addresses).
If only one good is sold, a bidder cannot make any additional profit by using multiple bids. However, in combinatorial auctions, where multiple
goods are sold simultaneously, submitting multiple bids under fictitious names can be profitable. A bid made under a fictitious name is called a {em false-name bid}. In this talk, I describe the summary of existing works and open problems
on false-name bids.

BibTeX - Entry

  author =	{Yokoo, Makoto},
  title =	{{False-name-Proof Combinatorial Auction Mechanisms}},
  booktitle =	{Computational Foundations of Social Choice},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10101},
  editor =	{Felix Brandt and Vincent Conitzer and Lane A. Hemaspaandra and Jean-Francois Laslier and William S. Zwicker},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-25621},
  doi =		{10.4230/DagSemProc.10101.3},
  annote =	{Keywords: Combinatorial auctions, mechanism design, false-name bids}

Keywords: Combinatorial auctions, mechanism design, false-name bids
Collection: 10101 - Computational Foundations of Social Choice
Issue Date: 2010
Date of publication: 20.05.2010

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