par Bruss, F Thomas 
;Louchard, Guy ;Ward, Mark Daniel
Référence ACM transactions on algorithms, 6, 1-21, page (1-19)
Publication Publié, 2009
;Louchard, Guy ;Ward, Mark DanielRéférence ACM transactions on algorithms, 6, 1-21, page (1-19)
Publication Publié, 2009
Article révisé par les pairs
| Résumé : | We consider auctions in which the winning bid is the smallest bid that is unique. Only the upperpricelimit is given. Neither the number of participants nor the distribution of the offers areknown, so that the problem of placing a bid to win with maximum probability looks, a priori, illposed.We will see, however, that no more than two external (and almost compelling) argumentsmake the problem meaningful. By appropriately modelling the relationship between the numberof participants and the distribution of the bids, we can then maximize our chances of winning theauction and propose a computable algorithm for placing our bid. |
