Started: 24 November 2004, 5:03 UTC
Finished: 19 October 2006, 15:28 UTC

Classless Charity Slave Auctions

Keywords: idea, script

In a traditional charity slave auction, the participants are first divided into slaves and buyers. Could this distinction be eliminated? Here's one possibility...

The participants are all in one group. Each participant bids on several others; the bids are collected and a combination calculated so that everyone is involved in at most one successful bid (whether as master or slave), while the total donation is maximised. The solution is displayed, and participants can up their bids until some pre-determined deadline or total.

Google suggests that a computer can calculate such a combination easily - here's the code, complexity O(n³) so it should run reasonably quickly. It's for undirected graphs, but that's OK - mutual bids are resolved in favour of the higher amount, which leaves a plain graph to work with.

Program:

Implemented! (new 19.10.2006) Download the code.

(You need both this and the weighted matching code.)

Notes:

Blog as a Pensieve
   
The map and the territory in the world of The SCO Group

comment by:
email: (will not be displayed)
6 times 5:


Home
Blog
Random
E-mail
IM


[æ]