<p>This question is hard to answer, because it is not clear what the appropriate multi-unit version of the single-unit second-price auction (SPA) actually is and which economic environment you have in mind. There are several possibilities, and I mention some.</p>
<p>There are 4 bidders and two units.</p>
<ol>
<li><p>All bidders draw a two values <span class="math-container">$v_{1i},v_{2i}$</span> representing the willingness-to-pay for unit <span class="math-container">$k\in\{1,2\}$</span>, having both units is valued <span class="math-container">$v_{1i}+v_{2i}$</span> (only one draw such that <span class="math-container">$v_{1i}=v_{2i}$</span> is also possible). There are two separate SPAs and in each one every bidder truthfully bids their value in equilibrium.</p>
</li>
<li><p>All bidders draw  two values <span class="math-container">$v_{1i}\geq v_{2i}$</span> representing the willingness-to-pay, where having one unit is valued <span class="math-container">$v_{1i}$</span>, having both units is valued <span class="math-container">$v_{1i}+v_{2i}$</span>. There is one uniform price auction, i.e., all bidders submit a bid vector <span class="math-container">$(b_1,b_2)$</span>, the highest two bids win and the payment per unit is the highest losing bid. It is a dominant strategy to bid truthfully on the first unit <span class="math-container">$b_1=v_{1i}$</span>, but not necessarily for the second unit, because the second bid could determine the price which a winner of one unit must pay.</p>
</li>
<li><p>All bidders draw  two values <span class="math-container">$v_{1i}\geq v_{2i}$</span> representing the willingness-to-pay, where having one unit is valued <span class="math-container">$v_{1i}$</span>, having both units is valued <span class="math-container">$v_{1i}+v_{2i}$</span>. There is one Vickrey auction, i.e., all bidders submit a bid vector <span class="math-container">$(b_1,b_2)$</span>, the highest two bids win and the payments are the highest losing bids of the opponents. It is a dominant strategy to bid truthfully on both units with the same argument as with a single unit.</p>
</li>
<li><p>All bidders have single-unit demand and draw a single value <span class="math-container">$v_i$</span>. Two SPAs are executed sequentially. The three remaining bidders bid truthfully in the final auction, but none of the four bidders in the first auction do, because there is a positive option value of losing the first auction: participating in the second auction.</p>
</li>
<li><p>All bidders have single-unit demand and draw a single value <span class="math-container">$v_i$</span>. A generalized second-price auction is executed, i.e., the highest bidder wins and pays the second-highest bid, the second-highest bidder wins and pays the third-highest bid. If two bidders submit high bids and the other two submit low bids, the highest bidder would prefer to bid lower in order to win the second unit instead to then pay the third-highest and lower bid.</p>
</li>
</ol>

CC BY-SA 4.0
2020-09-15T16:08:43.813Z
2020-09-15T16:08:43.813Z
Bayesian
<p>Suppose there are 4 individuals and two items in this particular(?) auction. I understand that the dominant strategy in second price auction is to bid your true value if there is a single item but I'm having a hard time understanding why that would change at all if there were two items.</p>

<game-theory><auctions>
How does your dominant strategy change in a second price auction if there are two items?
grod97
# How does your dominant strategy change in a second price auction if there are two items?

(Asked by: username_0 on 2019-09-27)

Suppose there are 4 individuals and two items in this particular(?) auction. I understand that the dominant strategy in second price auction is to bid your true value if there is a single item but I'm having a hard time understanding why that would change at all if there were two items.

**Tags:** game-theory, auctions

---

## 1 answers

### Answer by username_1 on 2020-09-15. Score: 2

This question is hard to answer, because it is not clear what the appropriate multi-unit version of the single-unit second-price auction (SPA) actually is and which economic environment you have in mind. There are several possibilities, and I mention some.

There are 4 bidders and two units.

1. All bidders draw a two values $v\_{1i},v\_{2i}$ representing the willingness-to-pay for unit $k\in\{1,2\}$, having both units is valued $v\_{1i}+v\_{2i}$ (only one draw such that $v\_{1i}=v\_{2i}$ is also possible). There are two separate SPAs and in each one every bidder truthfully bids their value in equilibrium.
2. All bidders draw two values $v\_{1i}\geq v\_{2i}$ representing the willingness-to-pay, where having one unit is valued $v\_{1i}$, having both units is valued $v\_{1i}+v\_{2i}$. There is one uniform price auction, i.e., all bidders submit a bid vector $(b\_1,b\_2)$, the highest two bids win and the payment per unit is the highest losing bid. It is a dominant strategy to bid truthfully on the first unit $b\_1=v\_{1i}$, but not necessarily for the second unit, because the second bid could determine the price which a winner of one unit must pay.
3. All bidders draw two values $v\_{1i}\geq v\_{2i}$ representing the willingness-to-pay, where having one unit is valued $v\_{1i}$, having both units is valued $v\_{1i}+v\_{2i}$. There is one Vickrey auction, i.e., all bidders submit a bid vector $(b\_1,b\_2)$, the highest two bids win and the payments are the highest losing bids of the opponents. It is a dominant strategy to bid truthfully on both units with the same argument as with a single unit.
4. All bidders have single-unit demand and draw a single value $v\_i$. Two SPAs are executed sequentially. The three remaining bidders bid truthfully in the final auction, but none of the four bidders in the first auction do, because there is a positive option value of losing the first auction: participating in the second auction.
5. All bidders have single-unit demand and draw a single value $v\_i$. A generalized second-price auction is executed, i.e., the highest bidder wins and pays the second-highest bid, the second-highest bidder wins and pays the third-highest bid. If two bidders submit high bids and the other two submit low bids, the highest bidder would prefer to bid lower in order to win the second unit instead to then pay the third-highest and lower bid.


---

