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 ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
ELR Bound - Binary Valued Buyers<br />
Proposition (Abhishek and Hajek 2010)<br />
Suppose A is downward closed. Given any r > 1, <strong>the</strong> worst case ELR<br />
for binary valued buyers, denoted by η(r, 2; A), s<strong>at</strong>isfies:<br />
η(r, 2; A) ≤ (r − 1)/(2r − 1).<br />
The worst case ELR for N buyers (not necessarily identically<br />
distributed) is no worse than it is for single buyer!<br />
Holds for arbitrary downward closed A.<br />
The worst case ELR ≤ 1/2 uniformly over all r.
Change language