Exercise 3.14: Challenging Question. In an attempt to reduce the deficit, the government of Italy has decided to sell a 14th century palace near Rome. The palace is in disrepair and is not generating any revenue for the government. From now on we'll call the government Player G. A Chinese millionaire has offered to purchase the palace for $p. Alternatively, Player G can organize an auction among n interested parties (n ≥ 2). The participants to the auction (we'll call them players) have been randomly assigned labels 1,2,...,n. Player is willing to pay up to $p, for the palace, where p, is a positive integer. For the auction assume the following: (1) it is a simultaneous, sealed-bid second-price auction, (2) bids must be non-negative integers, (3) each player only cares about his own wealth, (4) the tie-breaking rule for the auction is that the palace is given to that player who has the lowest index (e.g. if the highest bid was submitted by Players 3, 5 and 12 then the palace is given to Player 3). All of the above is commonly known among everybody involved, as is the fact that for every i, j = {1,...,n} with ij, p; p;. We shall consider various scenarios. In all scenarios you can assume that the p's are common knowledge. Scenario 1. Player G first decides whether to sell the palace to the Chinese millionaire or make a public and irrevocable decision to auction it. (a) Draw the extensive form of this game for the case where n = 2 and the only possible bids are $1 and $2. [List payoffs in the following order: first G then 1 then 2.1
Exercise 3.14: Challenging Question. In an attempt to reduce the deficit, the government of Italy has decided to sell a 14th century palace near Rome. The palace is in disrepair and is not generating any revenue for the government. From now on we'll call the government Player G. A Chinese millionaire has offered to purchase the palace for $p. Alternatively, Player G can organize an auction among n interested parties (n ≥ 2). The participants to the auction (we'll call them players) have been randomly assigned labels 1,2,...,n. Player is willing to pay up to $p, for the palace, where p, is a positive integer. For the auction assume the following: (1) it is a simultaneous, sealed-bid second-price auction, (2) bids must be non-negative integers, (3) each player only cares about his own wealth, (4) the tie-breaking rule for the auction is that the palace is given to that player who has the lowest index (e.g. if the highest bid was submitted by Players 3, 5 and 12 then the palace is given to Player 3). All of the above is commonly known among everybody involved, as is the fact that for every i, j = {1,...,n} with ij, p; p;. We shall consider various scenarios. In all scenarios you can assume that the p's are common knowledge. Scenario 1. Player G first decides whether to sell the palace to the Chinese millionaire or make a public and irrevocable decision to auction it. (a) Draw the extensive form of this game for the case where n = 2 and the only possible bids are $1 and $2. [List payoffs in the following order: first G then 1 then 2.1
Chapter1: Making Economics Decisions
Section: Chapter Questions
Problem 1QTC
Related questions
Question
Transcribed Image Text:Exercise 3.14: Challenging Question. In an attempt to reduce the deficit, the
government of Italy has decided to sell a 14th century palace near Rome. The palace is in
disrepair and is not generating any revenue for the government. From now on we'll call the
government Player G. A Chinese millionaire has offered to purchase the palace for $p.
Alternatively, Player G can organize an auction among n interested parties (n ≥ 2). The
participants to the auction (we'll call them players) have been randomly assigned labels
1,2,...,n. Player is willing to pay up to $p, for the palace, where p, is a positive integer. For
the auction assume the following: (1) it is a simultaneous, sealed-bid second-price auction, (2)
bids must be non-negative integers, (3) each player only cares about his own wealth, (4) the
tie-breaking rule for the auction is that the palace is given to that player who has the lowest
index (e.g. if the highest bid was submitted by Players 3, 5 and 12 then the palace is given to
Player 3). All of the above is commonly known among everybody involved, as is the fact
that for every i, j = {1,...,n} with ij, p; p;. We shall consider various scenarios. In
all scenarios you can assume that the p's are common knowledge.
Scenario 1. Player G first decides whether to sell the palace to the Chinese millionaire
or make a public and irrevocable decision to auction it.
(a) Draw the extensive form of this game for the case where n = 2 and the only
possible bids are $1 and $2. [List payoffs in the following order: first G then 1 then
2.1
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
Recommended textbooks for you
Principles of Economics (12th Edition)
Economics
ISBN:
9780134078779
Author:
Karl E. Case, Ray C. Fair, Sharon E. Oster
Publisher:
PEARSON
Engineering Economy (17th Edition)
Economics
ISBN:
9780134870069
Author:
William G. Sullivan, Elin M. Wicks, C. Patrick Koelling
Publisher:
PEARSON
Principles of Economics (12th Edition)
Economics
ISBN:
9780134078779
Author:
Karl E. Case, Ray C. Fair, Sharon E. Oster
Publisher:
PEARSON
Engineering Economy (17th Edition)
Economics
ISBN:
9780134870069
Author:
William G. Sullivan, Elin M. Wicks, C. Patrick Koelling
Publisher:
PEARSON
Principles of Economics (MindTap Course List)
Economics
ISBN:
9781305585126
Author:
N. Gregory Mankiw
Publisher:
Cengage Learning
Managerial Economics: A Problem Solving Approach
Economics
ISBN:
9781337106665
Author:
Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor
Publisher:
Cengage Learning
Managerial Economics & Business Strategy (Mcgraw-…
Economics
ISBN:
9781259290619
Author:
Michael Baye, Jeff Prince
Publisher:
McGraw-Hill Education