A reserve price is a minimum price set by the auctioneer. If no bidder is willing to pay the reserve price, the item is unsold at a profit of $0 for the auctioneer. If only one bidder values the item at or above the reserve price, that bidder pays the reserve price. An auctioneer faces two bidders, each with a value of either $75 or $200, with both values equally probable. Without a reserve price, the second highest bid will be the price paid by the winning bidder. The following table lists the four possible combinations of bidder values. Each combination is equally likely to occur. On the following table, indicate the price paid by the winning bidder with and without the stated reserve price. Bidder 1 Value Bidder 2 Value ($) ($) $75 $75 $75 $200 $200 $75 $200 $200 Probability 0.25 0.25 0.25 0.25 Without a reserve price, the expected price is $ expected price is larger the reserve price. Price Without Reserve ($) PPPP Price with $200 Reserve Price PPPP With a reserve price of $200, the expected price is $ . Thus, the

A reserve price is a minimum price set by the auctioneer. If no bidder is willing to pay the reserve price, the item is unsold at a profit of $0 for the auctioneer. If only one bidder values the item at or above the reserve price, that bidder pays the reserve price. An auctioneer faces two bidders, each with a value of either $75 or $200, with both values equally probable. Without a reserve price, the second highest bid will be the price paid by the winning bidder. The following table lists the four possible combinations of bidder values. Each combination is equally likely to occur. On the following table, indicate the price paid by the winning bidder with and without the stated reserve price. Bidder 1 Value Bidder 2 Value ($) ($) $75 $75 $75 $200 $200 $75 $200 $200 Probability 0.25 0.25 0.25 0.25 Without a reserve price, the expected price is $ expected price is larger the reserve price. Price Without Reserve ($) PPPP Price with $200 Reserve Price PPPP With a reserve price of $200, the expected price is $ . Thus, the

ENGR.ECONOMIC ANALYSIS

14th Edition

ISBN:9780190931919

Author:NEWNAN

Publisher:NEWNAN

Chapter1: Making Economics Decisions

Section: Chapter Questions

Problem 1QTC

See similar textbooks

Similar questions

Suppose there are two bidders for a single object. Each bidder has a value for the object, v1 and v2, which is randomly drawn uniformly from 0 to 80. (Note that this means the probability that a value is 25 or lower is 25/80, and more generally, the probability that a value is k or lower is k/80). Bidders see their own values but not the values of their rival bidders. Consider a first price sealed bid auction where the winner of the object is the bidder who submits the highest bid and pays the price that he bid. Suppose that you are bidder 1 and you believe that your rival always bids a constant fraction α of his value. (For example, if bidder 2’ value is 15, he will bid 15α.). 1. What is your expected winning probability of the auction from any given bid b1? (Hint, you win the auction when your bid amount b1 is greater than your opponent’s bid). 2. What is your expected payoff from any given bid, b1? (You need to write your answer as a function of v1, b1, and α). 3. Compute your best…
Exercise 1.8. Consider the following "third-price" auction. There are n≥ 3 bidders. A single object is auctioned and Player / values the object $v,, with V, > 0. The bids are simultaneous and secret. The utility of Player / is: 0 if she does not win and (v-p) if she wins and pays $p. Every non-negative number is an admissible bid. Let b, denote the bid of Player i. The winner is the highest bidder. In case of ties the bidder with the lowest index among those who submitted the highest bid wins (e.g. if the highest bid is $120 and it is submitted by players 6, 12 and 15, then the winner is Player 6). The losers don't get anything and don't pay anything. The winner gets the object and pays the third highest bid, which is defined as follows. Let be the winner and fix a Player j such that b₁ = max({b,,...,b,}\ {b}) [if GAME THEORY - Giacomo Bonanno 39 max({b,...,b}\{b;}) contains more than one element, then we pick one of them]. Then the third price is defined as max({b₁,...,b}\{b,,b;}).…
Why do sellers generally prefer a Vickrey auction to a regular sealed bid if sellers don’t receive the highest bid in the Vickrey auction? Sellers only have to sell their item if the bid is the highest-price bid. The second-highest bid in a Vickrey auction is generally higher than the highest bid in a regular sealed-bid auction. The second-highest bid is about the same in both auctions. Sellers prefer the final price is not revealed to all bidders. Sellers would never prefer Vickrey auctions.
Consider a first-price sealed-bid auction of a single object with two bidders j = 1, 2. Bidder 1's valuation is v1 = 2, and bidder 2' s valuation is v2 = 5. Both v1 and v2 are known to both bidders. Bids must be in whole dollar amounts (e.g. $1). In the event of a tie, the object is awarded by a flip of a fair coin. (a) Write down this auction as a 2 x 2 matrix game. Hint: note that each bidder can choose a bid from {0, 1, 2, 3, 4, 5, ...}. Your matrix will be incomplete since you cannot write a matrix with infinite rows and columns (b) Eliminate the strictly dominated strategies. Write down the resulting matrix game. (c) An auction is efficient if the good is allocated to the bidder with the highest valuation of the good. What are the Nash equilibria of this game? Are the Nash equilibria efficient?
Faris Co. and Fahad Co. are rivalry in Bahrain's market. Suppose the payoff to each of four strategic interactions are as follows: Faris Co. Response Action Reduce Price Don't Reduce Price Gain = BD 30,000 Reduce Price Loss = BD 1,000 Don't Reduce Price Loss = BD 5,000 No loss or gain The probability of Faris Co. to reduce price is 95 % (otherwise, probability of Faris Co. for not reducing price is 5 %), assume that Fahad Co. choose "reduce price" strategy a. What is size of loss from "reduce price" for Fahad Co.? b. What is size of gain from "don't reduce price" for Fahad Co? c. What is the expected payoff of a "reduce price" for Fahad Co.? and give an example (application) of d. Explain the concept of 'game theory' game theory Fahad Co. Response
The Government of Malaca has decided to sell pollution permits that will allow people to discharge pollutants into its largest freshwater lake. Each permit represents the right to discharge one tonne of pollutants. Malaca has determined that the lake will tolerate a maximum of 10 tonnes of pollutants per year and has decided to sell the permits using a Dutch auction. This means that the auction starts at a very high price, which is reduced in steps until the price reaches a level that will result in all 10 tonnes of pollution permits being sold at the same price. The results of the bidding are shown in table below. Price per Pollution Bidder Bidder Bidder Bidder Bidder Permit A. B D $5, 500 1 5,000 4,500 4,000 1. 1. 1 2 2. 3 2 1 2 3,500 3,000 2,500 2,000 4 3 2 4 4 4 3 4 4 1,500 7 a. What will be the price of pollution permits as a result of this auction? Price: $ b. Suppose that Bidder E happened to be an environmental protection group. If this group had not participated in the…
Next Friday, you plan to sell cakes at a bake sale to raise money for your school. You plan to charge $30 per cake, and you anticipate that you will sell 10 cakes. You can either purchase cakes to sell or bake them yourself. If you purchase the cakes, they will cost $25 each. If you bake your own cakes, your cost depends upon the number of cakes you bake, as shown in the table below. Number of cakes you bake Total cost of baked cakes ($) 0 0 1 10 2 22 3 36 4 52 5 70 6 90 7 112 8 136 9 162 10 190 a) How many cakes should you bake? How many cakes should you purchase? Bake ___ cake(s) and purchase ___ cake(s). b) Given your answer to part a, how much in total will the 10 cakes cost you? $ c) How much would it have cost you to bake all 10 cakes? $ d) How much would it have cost you to purchase all 10 cakes? $
Firms A and B are contemplating whether or not to invest in R&D. Each has two options: “Invest” and “Abstain.” A firm that invests will invent product X with a probability of 0.5, whereas a firm that abstains is incapable of invention. Investment costs $6. If a firm doesn’t invent X, it makes $0 in revenue. If a firm invests and is the only one to invent X, it becomes a monopolist and generates $20 in revenue. If both firms invent X, each firm becomes a duopolist, and generates $8 in revenue. Revenues are gross figures (i.e. they are not net of investment costs), and there are no costs besides investments costs (i.e. no variable cost of production etc.). The firms are risk-neutral entities, and are uninformed of each other’s investment decisions. The “research and development” game is best analyzed as a simultaneous move game, because the parties lack information about each other’s investment decisions. Find the Nash Equilibria (or Equilibrium) of the “research and development”…