Document Open Access Logo

False-name-Proof Combinatorial Auction Mechanisms

Author Makoto Yokoo



PDF
Thumbnail PDF

File

DagSemProc.10101.3.pdf
  • Filesize: 94 kB
  • 4 pages

Document Identifiers

Author Details

Makoto Yokoo

Cite AsGet BibTex

Makoto Yokoo. False-name-Proof Combinatorial Auction Mechanisms. In Computational Foundations of Social Choice. Dagstuhl Seminar Proceedings, Volume 10101, pp. 1-4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/DagSemProc.10101.3

Abstract

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.
Keywords
  • Combinatorial auctions
  • mechanism design
  • false-name bids

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail