• Posts
  • RSS
  • ◂◂RSS
  • Contact

  • All-Pay Auction for Charity

    June 12th, 2013
    giving  [html]
    While in a standard auction you have to pay your bid only if you win, in an all-pay auction you pay whether or not you win. The standard example is a dollar auction where you're selling a dollar. Bidding a penny to get a dollar seems reasonable, but someone else then might bid two cents. The bidding can keep going even past a dollar, and the more people fighting for the dollar the more the person selling it makes. Bidding-fee auctions are similar, where each bid you make costs money. You might remember Swoopo? They used to put up ads like "An iPad just sold for $21.32!" not mentioning that the participants overall had spent more than the retail cost of the iPad on bidding fees. Eventually people caught on and they went bankrupt.

    In a less scammy vein, however, this is also how competitive prizes work. In the X-Prize teams spent over $100M in competition for a $10M prize. I can't find an estimate for how much people spent to win the $1M Netflix Prize but when you look at the number of people and number of teams it was probably well above $1M.

    Could we use this for charity? Imagine a donor thought two charities were both excellent and had very similar returns, but they knew lots of other people strongly disagreed and preferred one or the other. By offering to donate $X to the charity that received the most in donations, could they move more than $X to the charity of their choice? It might be even better to make the criterion be the most independent donations of at least $Y, because getting more people to donate has value in terms of expected future donations.

    (I suggested something similar a few months ago in a comment on my post on donation matching, but hadn't thought about prizes at the time.)

    Comment via: google plus, facebook, lesswrong

    Recent posts on blogs I like:

    More on the Deutschlandtakt

    The Deutschlandtakt plans are out now. They cover investment through 2040, but even beforehand, there’s a plan for something like a national integrated timetable by 2030, with trains connecting the major cities every 30 minutes rather than hourly. But the…

    via Pedestrian Observations July 1, 2020

    How do cars fare in crash tests they're not specifically optimized for?

    Any time you have a benchmark that gets taken seriously, some people will start gaming the benchmark. Some famous examples in computing are the CPU benchmark specfp and video game benchmarks. With specfp, Sun managed to increase its score on 179.art (a su…

    via Posts on Dan Luu June 30, 2020

    Quick note on the name of this blog

    When I was 21 a friend introduced me to a volume of poems by the 14th-century Persian poet Hafiz, translated by Daniel Ladinsky. I loved them, and eventually named this blog for one of my favorite ones. At some point I read more and found that Ladinsky’s …

    via The whole sky June 21, 2020

    more     (via openring)


  • Posts
  • RSS
  • ◂◂RSS
  • Contact