diff options
| author | Markus Teich <markus.teich@stusta.mhn.de> | 2016-11-01 13:16:41 +0100 |
|---|---|---|
| committer | Markus Teich <markus.teich@stusta.mhn.de> | 2016-11-01 13:16:41 +0100 |
| commit | 44079d5cbbab5eeea367e9420b29c5b6f48eede8 (patch) | |
| tree | ba89ccb0855b7200712b5797de2ca692db7c3766 /brandt.h | |
| parent | e98bb69ce22f1b8680feaf163e34d9a8734652cc (diff) | |
| download | libbrandt-44079d5cbbab5eeea367e9420b29c5b6f48eede8.tar.gz libbrandt-44079d5cbbab5eeea367e9420b29c5b6f48eede8.zip | |
handle n <= m case in m+1st price auctions
The lowest possible price from the price map will be the price each bidder has
to pay. Since the seller can define the price map, he can set the lowest price
to the lowest he is willing to sell one item at.
Diffstat (limited to 'brandt.h')
0 files changed, 0 insertions, 0 deletions