On Revenue Optimal Combinatorial Auctions - IFP Group at the ...
On Revenue Optimal Combinatorial Auctions - IFP Group at the ...
On Revenue Optimal Combinatorial Auctions - IFP Group at the ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Worst Case ELR Comput<strong>at</strong>ion - Example<br />
Buyer 1<br />
1‐p p 0 < L < H<br />
r = H/L<br />
L H<br />
If pr < 1, <strong>the</strong>n w(L) > 0. The optimal alloc<strong>at</strong>ions is efficient.<br />
If pr ≥ 1, <strong>the</strong>n w(L) ≤ 0. The buyer wins only if he bids H.