Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Solution to exchanges 10.1 puzzle: Baffling Raffling debaffled

Published: 01 December 2011 Publication History

Abstract

Puzzle Editor's Note: This is the winning solution to Baffling Raffling from issue 10.1. The mechanism described there is sometimes known as a Chinese Auction. It is also equivalent, as McAfee points out, to a special case of a Cournot problem. An alternative formulation is: I decide a bid x, pay it in full, and then win the good with probability x/X where X is the sum of all the bids. Generalizing the question in the original puzzle, this solves the game for an arbitrary vector of common-knowledge valuations, i.e., the complete-information case with n agents.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGecom Exchanges
ACM SIGecom Exchanges  Volume 10, Issue 3
December 2011
37 pages
EISSN:1551-9031
DOI:10.1145/2325702
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 2011
Published in SIGECOM Volume 10, Issue 3

Check for updates

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 19
    Total Downloads
  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 11 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media