/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Problem 30 (Multi-unit auctions) Two units ... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

(Multi-unit auctions) Two units of an object are available. There are \(n\) bidders. Bidder \(i\) values the first unit that she obtains at \(v_{i}\) and the second unit at \(w_{i}\), where \(v_{i}>w_{i}>0\). Each bidder submits two bids; the two highest bids win. Retain the tie-breaking rule in the text. Show that in discriminatory and uniform-price auctions, player \(i^{\prime}\) s action of bidding \(v_{i}\) and \(w_{i}\) does not dominate all her other actions, whereas in a Vickrey auction it does. (In the case of a Vickrey auction, consider separately the cases in which the other players' bids are such that player \(i\) wins no units, one unit, and two units when her bids are \(v_{i}\) and \(w_{i}\).) Goods for which the demand exceeds the supply at the going price are sometimes sold to the people who are willing to wait longest in line. We can model such situations as multi-unit auctions in which each person's bid is the amount of time she is willing to wait.

Short Answer

Expert verified
Bidding \(v_i\) and \(w_i\) in discriminatory and uniform-price auctions is not universally dominant, but it is dominant in Vickrey auctions.

Step by step solution

01

Understand the bidding strategies

In these auctions, each bidder submits two bids for two units. Each bidder values the first unit at \(v_i\) and the second unit at \(w_i\) with \(v_i > w_i > 0\). Thus, the potential bids from a bidder can be \(v_i\) for the first unit and \(w_i\) for the second unit.
02

Discriminatory Auction Analysis

In discriminatory price auctions, each winning bidder pays his/her bid for each unit won. To show that bidding \(v_i\) and \(w_i\) doesn't dominate all other actions, consider a situation where bidder \(i\) might bid different values (e.g., higher or lower deviations from \(v_i\) and \(w_i\)).
03

Consider Alternative Bidding Strategies

Compare if a bidder uses various other bidding strategies. For example, suppose \(i\) bids \(v'_i\) and \(w'_i\) instead. Depending on the strategies and values submitted by other bidders, \(i\) might pay less or more than if they bid \(v_i\) and \(w_i\). This variability suggests that \(v_i\) and \(w_i\) is not universally dominant.
04

Uniform Price Auction Analysis

In uniform-price auctions, all winning bidders pay the same price, which is the highest losing bid. Consider if \(i\) bids \(v_i\) and \(w_i\) versus other strategies. Since the auction's price is determined by the highest losing bid, there may exist certain situations in which other bid strategies achieve better outcomes, again revealing that \(v_i\) and \(w_i\) is not a dominant strategy.
05

Vickrey Auction Analysis for Various Outcomes

In a Vickrey auction, each winner pays the second-highest bid. We will analyze three cases: \(i\) wins no units, one unit, and two units.
06

Analysis When Winning No Units

If \(i\) wins no units regardless of her bid, all bids have no effect on her payoff. However, this is trivial and does not affect the dominance.
07

Analysis When Winning One Unit

When \(i\) wins one unit, her payment is the second-highest bid among the other bidders. Since bidding \(v_i\) and \(w_i\) does not affect these outside values and ensures she values her unit appropriately, it's a strategic choice that aligns well.
08

Analysis When Winning Two Units

When \(i\) wins two units, the price paid for the second unit is determined by the second-highest of the remaining bids. Here, bidding \(v_i\) and \(w_i\) ensures she pays a reasonable price for units valued exactly at \(v_i\) and \(w_i\). This bidding strategy optimizes her payoff under the Vickrey auction rules.
09

Conclusion

Thus, in Vickrey auctions, bidding \(v_i\) and \(w_i\) ensures optimal payoffs as it is structured to align payments with individual valuations, making this a dominant strategy.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91Ó°ÊÓ!

Key Concepts

These are the key concepts you need to understand to accurately answer the question.

bidding strategies
In multi-unit auctions, you need to decide how to bid for each unit you're interested in. If a bidder values the first unit at \(v_i\) and the second unit at \(w_i\), with \(v_i > w_i > 0\), they might consider bidding exactly these values. However, this isn’t always the best strategy.
Different auction types may benefit from different bidding approaches. For example, in a discriminatory auction, you might alter your bids slightly to avoid paying more than necessary. In a uniform-price auction, bidding your true values might lead to overpayment. In Vickrey auctions, however, bidding your true values is generally a good strategy.
Therefore, understanding the auction type helps in formulating effective bidding strategies. Trying several strategies and understanding the impact of others’ bids are key elements in succeeding in these auctions.
discriminatory auction
In a discriminatory auction, each bidder who wins a unit pays exactly what they bid. Say you bid \(v_i\) for the first unit and \(w_i\) for the second. If you win both units, you'll pay \(v_i\) for the first and \(w_i\) for the second.
Imagine you have a competitor who bids slightly less than \(w_i\) for the second unit. If you bid slightly less than \(w_i\), you might still win the unit but pay less. This showcases that in discriminatory auctions, your exact values \(v_i\) and \(w_i\) do not always dominate other strategies. Adjusting your bids, depending on competitors' bids, might save you money.
Understanding your competitors’ potential bids and adjusting your own can lead to minimized costs and maximized benefits.
uniform-price auction
In uniform-price auctions, all winning bidders pay the price of the highest losing bid. For example, if the highest losing bid is \(x\), anyone winning a unit will pay \(x\), regardless of their initial bid.
If you bid \(v_i\) and \(w_i\), while other strategies might make you overbid, considering the lowest winning bid instead can optimize payment. For instance, if bidding slightly lower than \(v_i\) still secures you a unit but lowers the overall price, it pays off.
Thus, always bidding \(v_i\) and \(w_i\) may not be the best approach in uniform-price auctions. Instead, it's beneficial to consider potential competitors' bids and how the auction price derives from the highest losing bid. Optimizing against this can greatly influence the overall payout.
Vickrey auction
In Vickrey auctions, commonly known as second-price sealed-bid auctions, winners pay the second-highest bid rather than their own. This rule affects bidding strategy significantly.
  • Winning no units: Your bid doesn't affect your payoff if you win nothing. Hence, there's no strategic consequence in this scenario.
  • Winning one unit: Suppose you bid \(v_i\) for the first unit, and the highest bid among others is \(x\). If \(x < v_i\), you win one unit and pay the next highest bid. Since \(v_i\) and \(w_i\) don't affect the second-highest bid, they align well with potential payoffs.
  • Winning two units: Here, your optimal strategy must ensure that you pay reasonable prices aligned to \(v_i\) and \(w_i\). If you win two units, your payment for the second unit is reasonably pegged, ensuring optimal costs per unit.
Vickrey auctions incentivize truthful bidding, as bidding your valuations maximizes utility. This is because your bid doesn't affect the price you pay, making \(v_i\) and \(w_i\) dominant in this context.

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

EXERCISE \(85.1\) (First-price sealed-bid auction) Show that in a Nash equilibrium of a first-price sealed-bid auction the two highest bids are the same, one of these bids is submitted by player 1, and the highest bid is at least \(v_{2}\) and at most \(v_{1}\). Show also that any action profile satisfying these conditions is a Nash equilibrium. In any equilibrium in which the winning bid exceeds \(v_{2}\), at least one player's bid exceeds her valuation. As in a second-price sealed-bid auction, such a bid seems "risky", because it would yield the bidder a negative payoff if it were to win. In the equilibrium there is no risk, because the bid does not win; but, as before, the fact that the bid has this property reduces the plausibility of the equilibrium. As in a second-price sealed-bid auction, the potential "riskiness" to player \(i\) of a bid \(b_{i}>v_{i}\) is reflected in the fact that it is weakly dominated by the bid \(v_{i}\), as shown by the following argument. \- If the other players' bids are such that player \(i\) loses when she bids \(b_{i}\), then the outcome is the same whether she bids \(b_{i}\) or \(v_{i}\). \- If the other players' bids are such that player \(i\) wins when she bids \(b_{i}\), then her payoff is negative when she bids \(b_{i}\) and zero when she bids \(v_{i}\) (whether or not this bid wins). However, in a first-price auction, unlike a second-price auction, a bid \(b_{i}b_{i}\) because if the other players' highest bid is less than \(b_{i}\) then both \(b_{i}\) and \(b_{i}^{\prime}\) win and \(b_{i}\) yields a lower price. Further, even though the bid \(v_{i}\) weakly dominates higher bids, this bid is itself weakly dominated, by a lower bid! If player \(i\) bids \(v_{i}\) her payoff is 0 regardless of the other players' bids, whereas if she bids less than \(v_{i}\) her payoff is either 0 (if she loses) or positive (if she wins). In summary, in a first-price sealed-bid auction (with perfect information), a player's bid of at least her valuation is weakly dominated, and a bid of less than her valuation is not weakly dominated. An implication of this result is that in every Nash equilibrium of a first- price sealed-bid auction at least one player's action is weakly dominated. However, this property of the equilibria depends on the assumption that a bid may be any number. In the variant of the game in which bids and valuations are restricted to be multiples of some discrete monetary unit \(\epsilon\) (e.g. a cent), an action profile \(\left(v_{2}-\epsilon, v_{2}-\epsilon, b_{3}, \ldots, b_{n}\right)\) for any \(b_{j} \leq v_{j}-\epsilon\) for \(j=3, \ldots, n\) is a Nash equilibrium in which no player's bid is weakly dominated. Further, every equilibrium in which no player's bid is weakly dominated takes this form. When \(\epsilon\) is small, each such equilibrium is close to an equilibrium \(\left(v_{2}, v_{2}, b_{3}, \ldots, b_{n}\right)\) (with \(b_{j} \leq v_{j}\) for \(j=3, \ldots, n)\) of the game with unrestricted bids. On this (somewhat \(a d\) hoc) basis, I select action profiles \(\left(v_{2}, v_{2}, b_{3}, \ldots, b_{n}\right)\) with \(b_{j} \leq v_{j}\) for \(j=3, \ldots, n\) as "distinguished" equilibria of a first-price sealed-bid auction. One conclusion of this analysis is that while both second-price and first- price auctions have many Nash equilibria, yielding a variety of outcomes, their distinguished equilibria yield the same outcome. (Recall that the distinguished equilibrium of a second-price sealed-bid auction is the action profile in which every player bids her valuation.) In every distinguished equilibrium of each game, the object is sold to player 1 at the price \(v_{2} .\) In particular, the auctioneer's revenue is the same in both cases. Thus if we restrict attention to the distinguished equilibria, the two auction forms are "revenue equivalent". The rules are different, but the players' equilibrium bids adjust to the difference and lead to the same outcome: the single Nash equilibrium in which no player's bid is weakly dominated in a second-price auction yields the same outcome as the distinguished equilibria of a first-price auction.

(Electoral competition with three candidates) Consider a variant of Hotelling's model in which there are three candidates and each candidate has the option of staying out of the race, which she regards as better than losing and worse than tying for first place. Use the following arguments to show that the game has no Nash equilibrium. First, show that there is no Nash equilibrium in which a single candidate enters the race. Second, show that in any Nash equilibrium in which more than one candidate enters, all candidates that enter tie for first place. Third, show that there is no Nash equilibrium in which two candidates enter the race. Fourth, show that there is no Nash equilibrium in which all three candidates enter the race and choose the same position. Finally, show that there is no Nash equilibrium in which all three candidates enter the race, and do not all choose the same position.

Two firms are developing competing products for a market of fixed size. The longer a firm spends on development, the better its product. But the first firm to release its product has an advantage: the customers it obtains will not subsequently switch to its rival. (Once a person starts using a product, the cost of switching to an alternative, even one significantly better, is too high to make a switch worthwhile.) A firm that releases its product first, at time \(t\), captures the share \(h(t)\) of the market, where \(h\) is a function that increases from time 0 to time \(T\), with \(h(0)=0\) and \(h(T)=1\). The remaining market share is left for the other firm. If the firms release their products at the same time, each obtains half of the market. Each firm wishes to obtain the highest possible market share. Model this situation as a strategic game and find its Nash equilibrium (equilibria?). (When finding firm \(i^{\prime}\) s best response to firm \(j\) 's release time \(t_{j}\), there are three cases: that in which \(h\left(t_{j}\right)<\frac{1}{2}\) (firm \(j\) gets less than half of the market if it is the first to release its product), that in which \(h\left(t_{j}\right)=\frac{1}{2}\), and that in which \(h\left(t_{j}\right)>\frac{1}{2}\).)

(A fight) Each of two people has one unit of a resource. Each person chooses how much of the resource to use in fighting the other individual and how much to use productively. If each person \(i\) devotes \(y_{i}\) to fighting then the total output is \(f\left(y_{1}, y_{2}\right) \geq 0\) and person \(i\) obtains the fraction \(p_{i}\left(y_{1}, y_{2}\right)\) of the output, where $$ p_{i}\left(y_{1}, y_{2}\right)= \begin{cases}1 & \text { if } y_{i}>y_{j} \\\ \frac{1}{2} & \text { if } y_{i}=y_{j} \\ 0 & \text { if } y_{i}

(Electoral competition for more general preferences) There is a finite number of positions and a finite, odd, number of voters. For any positions \(x\) ind \(y\), each voter either prefers \(x\) to \(y\) or prefers \(y\) to \(x\). (No voter regards any two positions as equally desirable.) We say that a position \(x^{*}\) is a Condorcet winner if for very position \(y\) different from \(x^{*}\), a majority of voters prefer \(x^{*}\) to \(y\). \(a\). Show that for any configuration of preferences there is at most one Condorcet winner. b. Give an example in which no Condorcet winner exists. (Suppose there are three positions \((x, y\), and \(z)\) and three voters. Assume that voter 1 prefers \(x\) to \(y\) to \(z\). Construct preferences for the other two voters such that one voter prefers \(x\) to \(y\) and the other prefers \(y\) to \(x\), one prefers \(x\) to \(z\) and the other prefers \(z\) to \(x\), and one prefers \(y\) to \(z\) and the other prefers \(z\) to \(y\). The preferences you construct must, of course, satisfy the condition that a voter who prefers \(a\) to \(b\) and \(b\) to \(c\) also prefers \(a\) to \(c\), where \(a, b\), and \(c\) are any positions.) c. Consider the strategic game in which two candidates simultaneously choose positions, as in Hotelling's model. If the candidates choose different positions, each voter endorses the candidate whose position she prefers, and the candidate who receives the most votes wins. If the candidates choose the same position, they tie. Show that this game has a unique Nash equilibrium if the voters' preferences are such that there is a Condorcet winner, and has no Nash equilibrium if the voters' preferences are such that there is no Condorcet winner. A variant of Hotelling's model of electoral competition can be used to analyze he choices of product characteristics by competing firms in situations in which lext exercise you are asked to show that the Nash equilibria of this game in the fase of two or three firms are the same as those in Hotelling's model of electoral competition.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.