Right to choose in oral auctions

Size: px
Start display at page:

Download "Right to choose in oral auctions"

Transcription

1 Economics Letters 95 (007) Right to choose in oral auctions Roberto Burguet Institute for Economic Analysis (CSIC), Campus UAB, Bellaterra, Barcelona, Spain Received 9 May 006; received in revised form 30 August 006; accepted 18 September 006 Available online February 007 Abstract Oral, right-to-choose auctions raise higher revenue when buyers are risk averse. When standard sequential and right-to-choose auctions allocate the objects in the same fashion, this means that sellers prefer the latter. 006 Elsevier B.V. All rights reserved. Keywords: Risk aversion; Sequential auctions JEL classification: D44 1. Introduction A right-to-choose (RTC) auction of several (similar) goods is a sequence of auction rounds where the winner of each chooses among the so far unsold goods. 1 This is, for instance, the usual way condominium units are auctioned (see Ashenfelter and Genesove (199)). In this note we show that this auction format allows the seller to cash on the buyers' risk aversion. As perhaps the simplest illustration, assume there are two potential buyers of two apartments, A and B. Each buyer is willing to pay 1 for one of the two apartments (and 0 for the other), but neither bidder knows I acknowledge support from the Spanish Ministry of Education through SEC C0-0 and from CREA. Tel.: ; fax: address: roberto.burguet@uab.es. 1 Menezes and Monteiro (1998) study closely related auctions called pooled auctions, where bidders submit a unique, sealed bid for K objects. The K highest bidders choose in order one of these objets. They characterize equilibrium of this auction when relative preferences over the objects are common to all bidders /$ - see front matter 006 Elsevier B.V. All rights reserved. doi: /j.econlet

2 168 R. Burguet / Economics Letters 95 (007) which apartment the other prefers. Ex-ante, either buyer prefers apartment A with a (independent) probability of 1/. If apartment A is auctioned first, a buyer who prefers apartment B will not bid. If the buyer prefers apartment A, she will be willing to match all rival bids up to 1. Something similar will happen in the second round, when apartment B is auctioned. Thus, with a probability of 1/, (both bidders like the same apartment and) bidders will raise their offers for their common preferred apartment until the price reaches 1, which will be the revenue that the seller will get (the other apartment will sell for 0). With a probability of 1/, buyers will be interested in different apartments and the seller will get zero revenues. Therefore, the expected revenue for the seller is 1/. If the seller chooses to auction the RTC, loosing the first round means that the rival will choose her preferred apartment (and leave the other available at a price of zero). Let the preferences be represented by the von Neumann Morgensten utility function u(θp) where P is the price paid, θ=1 if the buyer gets the apartment she prefers, and θ=0 otherwise. Then her optimal strategy today is to match all prices up to b, where uð1bþ ¼ 1 uð1þþ1 uð0þ: If buyers are risk neutral, b=1/ (which coincides with the seller's revenue) and both auction formats, the RTC and the standard sequential, raise the same expected revenue: 1/. However, if the buyers are risk averse, b N 1/, and then the RTC format raises more revenue in expected terms: buyers are willing to pay a premium in the less informative RTC auction. In this example, a bidder's behavior reveals information about her willingness to pay for her preferred apartment, but nothing about what this apartment may be. This makes the value of a subsequent auction round more uncertain for rival bidders. Thus, risk averse bidders are willing to pay a premium in order to secure their winning in the first round. What I do in this note is to extend this simple intuition to a model that includes a continuum of valuations and an arbitrary number of buyers. Gale and Hausch (1994) were pioneer in analyzing the RTC in auctions. In their paper, standard, sequential (sealed bid) auctions may be inferior to RTC auctions because what they call bottom-fishing. Bidders who prefer the object auction in second place still put very low bids in the first round to benefit in case competition turns out to be fierce for their preferred object and very low for the other, first auctioned object. The effect of bottom-fishing depends crucially on the authors' assumption that a bidder that obtains one object cannot attempt to acquire the other even if she prefers the latter. I do not make this assumption. However, the case I study is not more general, since I consider one-dimensional private information (about preferences). Recently, Goeree et al. (004) have conducted experiments based in this note. Their experimental data confirmed our predictions. For the single unit case, Maskin and Riley (1984) have shown that it is in the seller's interest to screen risk averse buyers by making their utility when winning and losing different. They also show that Eliaz et al. (004) also report experimental results on RTC auctions with risk neutral bidders, and argue that restricting the number of goods sold may increase revenues. Also related, in Burguet (005) I show that RTC auctions are efficient under risk neutrality, and characterize the optimal auction under this assumption.

3 R. Burguet / Economics Letters 95 (007) introducing uncertainty about the payment conditional on winning is no revenue enhancing. The RTC auction reduces the randomness of payments from an ex-ante point of view. RTC auctions pool together the randomness originated in the uncertainty about rivals' relative preferences over the objects. Payments conditioned on winning the preferred object depend on other buyers' willingness to pay for their respective preferred objects, but not on what these may be. In this sense, the results of this note are consistent with the general intuition given by Maskin and Riley.. The model There are N 3 potential buyers for two distinct objects, A and B. Buyer i's preferences, i=1,,, N are characterized by two parameters (t i, θ i ), where t i {A, B} the type, and θ i [0, 1], the valuation. For each i, t i takes the value A with a probability of 1/ and the value B with a probability of 1/. Also, θ i is the realization of a random variable with c.d.f. F and density f which takes positive values on [0, 1]. All random variables are independent and common knowledge. In addition, buyer i knows the realization of (t i, θ i ). The pay-off for buyer i with parameters (t i, θ i ) who obtains object t i at a price P is U½t i ; P; ðt i ; h i ÞŠ ¼ uðh i PÞ; ð1þ where u is a concave, von Neumann Morgensten utility function with u(0) = 0. Also, the pay-off for buyer i who pays P and gets either an object different from t i or no object is U½t; P; ðt i ; h i ÞŠ ¼ U½Ipt i ; P; ðt i ; h i ÞŠ ¼ uðpþ: ðþ For the moment, we assume that a buyer cannot buy both objects. Then, we do not need to define preferences for that case. 3. Standard sequential and right-to-choose auctions Assume object A is offered for sale in the first place. We model the English (oral ascending) auction as a clock auction (prices ascend continuously, bidders decide when to drop out, with no reentry). In principle, a strategy 3 for a buyer in the first auction (round) is a multidimensional mapping. It maps the set of parameters (t i, θ i ), the set of integers n {0, N }, and the set of vectors ( p 1,..., p n ) in R n, with p 1.. p n, into the set [ p n, ). 4 In fact, an (symmetric) equilibrium bidding strategy is quite straightforward in this case. Indeed, we should expect bidders to drop out immediately if their types do not coincide with the object being sold. Also, a buyer's 3 Given the symmetry of buyers, we will only consider anonymous bidding strategies, in which behavior does not depend on who took an action, but only on the nature of this action. 4 To avoid difficulties with what is the next moment in continuous time, we assume that whenever one buyer drops out, the clock stops and there is time for other buyers to drop out at that same price.

4 170 R. Burguet / Economics Letters 95 (007) best dropping-out policy is to stay until the clock reaches her willingness to pay in the round where the preferred object is auctioned. Proposition 1. In the standard sequential auction, an equilibrium (in weakly dominant strategies) is to drop out in each round at a price equal to the willingness to pay for the object being sold. Corollary 1. The object I is won by the buyer of type t=i with the highest valuation, if there is any. Corollary. Both the allocation and the prices are independent of the buyers' risk attitudes. In particular, the outcome of the auctions is the same as the one obtained when buyers are risk neutral. Now assume that the seller conducts an oral, ascending auction for the RTC. The rules of the auction are as in the standard sequential auction, but now the winner of the first round chooses whether to take object A or object B. Given all the symmetry that we have assumed, one would not expect the behavior to depend on the type. Moreover, one would expect that buyers with higher valuation would stay longer than buyers with lower valuation. Finally, in the second auction staying up to willingness to pay (whether 0 or θ) still is a dominant strategy. Thus, we propose a bidding strategy in the first round common for buyers of both types. This is a collection of N1 functions B n for n=0,1,, N, where B n maps the set of buyer's valuations and vectors of positive real numbers ( p 1,, p n )withp 1 p n, into the set [p n, ). We look for a symmetric, monotone equilibrium, that is, one in which B n (θ; p 1,, p n ) is non-decreasing in θ. If buyers behave in this fashion, the fact that one drops out at a given price in the first auction does not convey information with respect to her type. Also, even the first buyer to drop out expects to obtain her preferred object with positive probability in the second round. Indeed, since no information about the type is revealed, when a buyer drops out she still assigns positive probability to the event that all remaining buyers are of a type different to hers. We present equilibrium strategies with these properties in the Appendix. However, all that will be relevant is: Proposition. In equilibrium, bidders bid monotonically in the valuation and independently of their type in the first round. Proof. See Appendix. Corollary 3. The buyer with highest valuation obtains her preferred object. The remaining object is won by the buyer with highest willingness to pay for it among the remaining buyers. As opposed to what was the case in the sequential auction, here the attitude towards risk does play a role. In particular: Corollary 4. The seller expects higher revenue when the buyers are risk averse than when they are risk neutral. Proof. See Appendix. 4. Comparing the two mechanisms We could directly compare the revenues for the seller in both mechanisms. However, we will proceed in the tradition of revenue equivalence for risk neutral agents. Once this is done, the corollaries to Propositions 1 and will directly imply that risk aversion makes the RTC auction a more attractive one for a risk neutral seller.

5 R. Burguet / Economics Letters 95 (007) Thus, for any (anonymous, for economy of notation) mechanism (and one of its equilibria) for assigning both objects, let us specify the 6-tuple {x A, x B, P A, P B } where x I : Θ [0, 1], and P I : Θ R, I=A, B, where the value x I (θ) represents the probability that a buyer of type I obtains object I when her valuation is θ (and everybody behaves as the equilibrium predicts), and P I (θ) is the expected payment in such a case. Then, if buyers are risk neutral, incentive compatibility (a necessary condition for equilibrium behavior) requires h ¼ arg max za½0;1š x IðzÞhP I ðzþ; for all θ, for a buyer of type A. Under differentiability, the first order condition for this problem is the following differential equation dp I ðhþ dh ¼ dx IðhÞ dh h; which integrating (by parts) gives R I ðhþr I ð0þ ¼ Z h 0 x I ðzþdz; where R I (z)=x I (z) zp I (z) represents the equilibrium rents of a buyer of type I and valuation z. That means that the revenue equivalence holds in this situation, i.e., any two mechanisms that assign the objects in the same fashion and for which a buyer with valuation 0 obtains the same rents, for both type A and type B, give the seller the same expected revenue. We have seen that the allocation of the objects is the same in both mechanisms analyzed. Also, R I (0)=0. Then, the seller's expected revenue when buyers are risk neutral is also the same. On the other hand, the seller's revenue does not depend on risk attitudes, in the case of a sequential auction, but is higher in the RTC auction when buyers are risk averse. Thus: Proposition 3. Under risk neutrality, the seller expects the same revenue whether he uses a right-tochoose or a sequential auction. However, if buyers are risk averse, the former raises higher expected revenue than the latter. 5. Concluding remarks I have discussed the advantage of RTC auctions when buyers are risk averse. Sequential auctions reveal too much information to bidders, so that, if they loose in early rounds, they face less uncertain future competition. In contrast, auctioning the RTC can be considered as an instrument to reduce this flow of information in early rounds. By using this auction format, the seller is able to make buyers more willing to bid aggressively in these early rounds to avoid this risk. There are several ways in which the preferences considered in this paper can be extended with no change in the conclusions. Some of them are discussed in the working paper version of this note (Burguet, 1999). They include a positive willingness to pay for the less preferred object and multiple unit demands, under some restrictions. As in Burguet (005), the main assumption, however, is the restriction to one-dimensional private information.

6 17 R. Burguet / Economics Letters 95 (007) Appendix A Proof of Proposition. We propose the following dropping-out strategies, defined inductively. B 0 ðhþ ¼hu 1 1 N1 uðhþ! : Having defined B j (θ; p 1,, p j1 ), define B 1 j1 ( p j ; p 1,..., p j1 ) as the value of θ such that B j1 (θ; p 1,, p j1 )=p j. Then, for nn0 B n ðh; p 1 ; N ; p n Þ¼hu 1 1 N1 uðhþþ Xn! 1 Nk uðhb 1 k1 ð p k; p 1 ; N ; p k1 ÞÞ : We can check that all these functions are increasing in θ. This follows from the fact that 1 N1þ P n Nkb1 1 for nbn1, and the fact that u is decreasing. Thus, from (A) 1 N1 uvðþ¼uv h ðhb 0 ðþ h Þð1B 0 VðÞ h Þ; which shows both that B 0 (θ)n0 and that B 0 (θ)n1. Using the second fact inductively, we can show that indeed all the functions are monotonic. Also, for θ=b 1 n1 ( p n ; p 1,,p n1 ), B n (θ; p 1,, p n )=B n1 (θ; p 1,, p n1 ). That is, when a bidder drops out this does not induce another bidder to drop out with discrete probability. Continuity and monotonicity allow bidders to infer valuations of dropping-out bidders as B 1 j1 ( p j ; p 1,,p j1 ), without changing the ex-ante probability of their types. Then the dropping-out 1 N1uðhÞþ strategies P are standard equilibrium strategies for sequential English auctions: n NkuðhB 1 1 k1 ðp k; p 1 ; N ; p k1 ÞÞ is the expected profit if staying (infinitesimally) longer conditional on all remaining bidders having a valuation equal to the bidder's valuation. Proof of Corollary 4. The price in the second round is independent of risk attitudes. For any realization of (θ 1, θ, θ N ) with θ 1 θ θ N, B 1 k1 ( p k ; p 1,, p k1 ) for all k is also independent of risk attitudes (in both cases, bidding functions are monotonically). Thus, when u is strictly concave, 1 N1 uðh XN 1 Nk N1Þþ uðh N1B 1 k1 ð p k; p 1 ; N ; p k1 ÞÞ 1 N1! bu h N1 þ XN 1 Nk ðh N1B 1 k1 ð p k; p 1 ; N ; p k1 ÞÞ ; so that h N1 u 1 1 N1! uðh XN 1 Nk N1Þþ uðh N1B 1 k1 ð p k; p 1 ; N ; p k1 ÞÞ 1 N1! Nh N1 h N1 þ XN 1 Nk ðh N1B 1 k1 ð p k; p 1 ; N ; p k1 ÞÞ : The right hand side is the price in case u is linear (risk neutral bidders).

7 R. Burguet / Economics Letters 95 (007) References Ashenfelter, O., Genesove, D., 199. Testing for price anomalies in real-estate auctions. American Economic Review 8, Burguet, R., Right to Choose in Oral Auctions. Institute for Eco-nomic Analysis (CSIC). W.P Burguet, R., 005. The condominium problem; auctions for substitutes. Review of Economic Design 9, Eliaz, K., Offerman, T., Schotter, A., 004. Creating competition out of thin air: market thickening and right-to-choose auctions. CEPR Discussion Papers Gale, I., Hausch, D., Bottom-fishing and declining prices in sequential auctions. Games and Economic Behavior 7, Goeree, J.K., Wooders, J., Plott, C.R., 004. Bidders' choice auctions: raising revenues through the right to choose. Journal of the European Economic Association, Maskin, E., Riley, J., Optimal auctions with risk averse buyers. Econometrica 5 6, Menezes, F.M., Monteiro, P.K., Simultaneous pooled auctions. The Journal of Real Estate Finance and Economics 17 3, 19 3.

BIDDERS CHOICE AUCTIONS: RAISING REVENUES THROUGH THE RIGHT TO CHOOSE

BIDDERS CHOICE AUCTIONS: RAISING REVENUES THROUGH THE RIGHT TO CHOOSE BIDDERS CHOICE AUCTIONS: RAISING REVENUES THROUGH THE RIGHT TO CHOOSE Jacob K. Goeree CREED and University of Amsterdam Charles R. Plott California Institute of Technology John Wooders University of Arizona

More information

KIER DISCUSSION PAPER SERIES

KIER DISCUSSION PAPER SERIES KIER DISCUSSION PAPER SERIES KYOTO INSTITUTE OF ECONOMIC RESEARCH http://www.kier.kyoto-u.ac.jp/index.html Discussion Paper No. 657 The Buy Price in Auctions with Discrete Type Distributions Yusuke Inami

More information

Revenue Equivalence and Income Taxation

Revenue Equivalence and Income Taxation Journal of Economics and Finance Volume 24 Number 1 Spring 2000 Pages 56-63 Revenue Equivalence and Income Taxation Veronika Grimm and Ulrich Schmidt* Abstract This paper considers the classical independent

More information

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012 Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012 The Revenue Equivalence Theorem Note: This is a only a draft

More information

Auctions. Agenda. Definition. Syllabus: Mansfield, chapter 15 Jehle, chapter 9

Auctions. Agenda. Definition. Syllabus: Mansfield, chapter 15 Jehle, chapter 9 Auctions Syllabus: Mansfield, chapter 15 Jehle, chapter 9 1 Agenda Types of auctions Bidding behavior Buyer s maximization problem Seller s maximization problem Introducing risk aversion Winner s curse

More information

Auctions That Implement Efficient Investments

Auctions That Implement Efficient Investments Auctions That Implement Efficient Investments Kentaro Tomoeda October 31, 215 Abstract This article analyzes the implementability of efficient investments for two commonly used mechanisms in single-item

More information

Comparing Allocations under Asymmetric Information: Coase Theorem Revisited

Comparing Allocations under Asymmetric Information: Coase Theorem Revisited Comparing Allocations under Asymmetric Information: Coase Theorem Revisited Shingo Ishiguro Graduate School of Economics, Osaka University 1-7 Machikaneyama, Toyonaka, Osaka 560-0043, Japan August 2002

More information

Reserve Prices without Commitment

Reserve Prices without Commitment GAMES AND ECONOMIC BEHAVIOR 15, 149 164 (1996) ARTICLE NO. 0063 Reserve Prices without Commitment Roberto Burguet and József Sákovics Instituto de Análisis Económico (CSIC), Campus UAB, 08193 Bellaterra,

More information

Recap First-Price Revenue Equivalence Optimal Auctions. Auction Theory II. Lecture 19. Auction Theory II Lecture 19, Slide 1

Recap First-Price Revenue Equivalence Optimal Auctions. Auction Theory II. Lecture 19. Auction Theory II Lecture 19, Slide 1 Auction Theory II Lecture 19 Auction Theory II Lecture 19, Slide 1 Lecture Overview 1 Recap 2 First-Price Auctions 3 Revenue Equivalence 4 Optimal Auctions Auction Theory II Lecture 19, Slide 2 Motivation

More information

Optimal Auctions. Game Theory Course: Jackson, Leyton-Brown & Shoham

Optimal Auctions. Game Theory Course: Jackson, Leyton-Brown & Shoham Game Theory Course: Jackson, Leyton-Brown & Shoham So far we have considered efficient auctions What about maximizing the seller s revenue? she may be willing to risk failing to sell the good she may be

More information

Chapter 3. Dynamic discrete games and auctions: an introduction

Chapter 3. Dynamic discrete games and auctions: an introduction Chapter 3. Dynamic discrete games and auctions: an introduction Joan Llull Structural Micro. IDEA PhD Program I. Dynamic Discrete Games with Imperfect Information A. Motivating example: firm entry and

More information

Auctions: Types and Equilibriums

Auctions: Types and Equilibriums Auctions: Types and Equilibriums Emrah Cem and Samira Farhin University of Texas at Dallas emrah.cem@utdallas.edu samira.farhin@utdallas.edu April 25, 2013 Emrah Cem and Samira Farhin (UTD) Auctions April

More information

Optimal Repeated Purchases When Sellers Are Learning about Costs

Optimal Repeated Purchases When Sellers Are Learning about Costs journal of economic theory 68, 440455 (1996) article no. 0025 Optimal Repeated Purchases When Sellers Are Learning about Costs Roberto Burguet* Instituto de Ana lisis Econo mico (CSIC), Campus UAB, 08193-Bellaterra,

More information

Problem Set 3: Suggested Solutions

Problem Set 3: Suggested Solutions Microeconomics: Pricing 3E00 Fall 06. True or false: Problem Set 3: Suggested Solutions (a) Since a durable goods monopolist prices at the monopoly price in her last period of operation, the prices must

More information

1 Theory of Auctions. 1.1 Independent Private Value Auctions

1 Theory of Auctions. 1.1 Independent Private Value Auctions 1 Theory of Auctions 1.1 Independent Private Value Auctions for the moment consider an environment in which there is a single seller who wants to sell one indivisible unit of output to one of n buyers

More information

Up till now, we ve mostly been analyzing auctions under the following assumptions:

Up till now, we ve mostly been analyzing auctions under the following assumptions: Econ 805 Advanced Micro Theory I Dan Quint Fall 2007 Lecture 7 Sept 27 2007 Tuesday: Amit Gandhi on empirical auction stuff p till now, we ve mostly been analyzing auctions under the following assumptions:

More information

1 Auctions. 1.1 Notation (Symmetric IPV) Independent private values setting with symmetric riskneutral buyers, no budget constraints.

1 Auctions. 1.1 Notation (Symmetric IPV) Independent private values setting with symmetric riskneutral buyers, no budget constraints. 1 Auctions 1.1 Notation (Symmetric IPV) Ancient market mechanisms. use. A lot of varieties. Widespread in Independent private values setting with symmetric riskneutral buyers, no budget constraints. Simple

More information

Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets

Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets Nathaniel Hendren October, 2013 Abstract Both Akerlof (1970) and Rothschild and Stiglitz (1976) show that

More information

AUCTIONEER ESTIMATES AND CREDULOUS BUYERS REVISITED. November Preliminary, comments welcome.

AUCTIONEER ESTIMATES AND CREDULOUS BUYERS REVISITED. November Preliminary, comments welcome. AUCTIONEER ESTIMATES AND CREDULOUS BUYERS REVISITED Alex Gershkov and Flavio Toxvaerd November 2004. Preliminary, comments welcome. Abstract. This paper revisits recent empirical research on buyer credulity

More information

by open ascending bid ("English") auction Auctioneer raises asking price until all but one bidder drops out

by open ascending bid (English) auction Auctioneer raises asking price until all but one bidder drops out Auctions. Auction off a single item (a) () (c) (d) y open ascending id ("English") auction Auctioneer raises asking price until all ut one idder drops out y Dutch auction (descending asking price) Auctioneer

More information

Notes on Auctions. Theorem 1 In a second price sealed bid auction bidding your valuation is always a weakly dominant strategy.

Notes on Auctions. Theorem 1 In a second price sealed bid auction bidding your valuation is always a weakly dominant strategy. Notes on Auctions Second Price Sealed Bid Auctions These are the easiest auctions to analyze. Theorem In a second price sealed bid auction bidding your valuation is always a weakly dominant strategy. Proof

More information

Games of Incomplete Information ( 資訊不全賽局 ) Games of Incomplete Information

Games of Incomplete Information ( 資訊不全賽局 ) Games of Incomplete Information 1 Games of Incomplete Information ( 資訊不全賽局 ) Wang 2012/12/13 (Lecture 9, Micro Theory I) Simultaneous Move Games An Example One or more players know preferences only probabilistically (cf. Harsanyi, 1976-77)

More information

ECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2017

ECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2017 ECON 459 Game Theory Lecture Notes Auctions Luca Anderlini Spring 2017 These notes have been used and commented on before. If you can still spot any errors or have any suggestions for improvement, please

More information

Strategy -1- Strategic equilibrium in auctions

Strategy -1- Strategic equilibrium in auctions Strategy -- Strategic equilibrium in auctions A. Sealed high-bid auction 2 B. Sealed high-bid auction: a general approach 6 C. Other auctions: revenue equivalence theorem 27 D. Reserve price in the sealed

More information

Day 3. Myerson: What s Optimal

Day 3. Myerson: What s Optimal Day 3. Myerson: What s Optimal 1 Recap Last time, we... Set up the Myerson auction environment: n risk-neutral bidders independent types t i F i with support [, b i ] and density f i residual valuation

More information

All Equilibrium Revenues in Buy Price Auctions

All Equilibrium Revenues in Buy Price Auctions All Equilibrium Revenues in Buy Price Auctions Yusuke Inami Graduate School of Economics, Kyoto University This version: January 009 Abstract This note considers second-price, sealed-bid auctions with

More information

Auctions. Episode 8. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto

Auctions. Episode 8. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto Auctions Episode 8 Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto Paying Per Click 3 Paying Per Click Ads in Google s sponsored links are based on a cost-per-click

More information

Last-Call Auctions with Asymmetric Bidders

Last-Call Auctions with Asymmetric Bidders Last-Call Auctions with Asymmetric Bidders Marie-Christin Haufe a, Matej Belica a a Karlsruhe nstitute of Technology (KT), Germany Abstract Favoring a bidder through a Right of First Refusal (ROFR) in

More information

Independent Private Value Auctions

Independent Private Value Auctions John Nachbar April 16, 214 ndependent Private Value Auctions The following notes are based on the treatment in Krishna (29); see also Milgrom (24). focus on only the simplest auction environments. Consider

More information

Efficiency in auctions with crossholdings

Efficiency in auctions with crossholdings Efficiency in auctions with crossholdings David Ettinger August 2002 Abstract We study the impact of crossholdings on the efficiency of the standard auction formats. If both bidders with crossholdings

More information

ISSN BWPEF Uninformative Equilibrium in Uniform Price Auctions. Arup Daripa Birkbeck, University of London.

ISSN BWPEF Uninformative Equilibrium in Uniform Price Auctions. Arup Daripa Birkbeck, University of London. ISSN 1745-8587 Birkbeck Working Papers in Economics & Finance School of Economics, Mathematics and Statistics BWPEF 0701 Uninformative Equilibrium in Uniform Price Auctions Arup Daripa Birkbeck, University

More information

March 30, Why do economists (and increasingly, engineers and computer scientists) study auctions?

March 30, Why do economists (and increasingly, engineers and computer scientists) study auctions? March 3, 215 Steven A. Matthews, A Technical Primer on Auction Theory I: Independent Private Values, Northwestern University CMSEMS Discussion Paper No. 196, May, 1995. This paper is posted on the course

More information

On Existence of Equilibria. Bayesian Allocation-Mechanisms

On Existence of Equilibria. Bayesian Allocation-Mechanisms On Existence of Equilibria in Bayesian Allocation Mechanisms Northwestern University April 23, 2014 Bayesian Allocation Mechanisms In allocation mechanisms, agents choose messages. The messages determine

More information

An Ascending Double Auction

An Ascending Double Auction An Ascending Double Auction Michael Peters and Sergei Severinov First Version: March 1 2003, This version: January 20 2006 Abstract We show why the failure of the affiliation assumption prevents the double

More information

Today. Applications of NE and SPNE Auctions English Auction Second-Price Sealed-Bid Auction First-Price Sealed-Bid Auction

Today. Applications of NE and SPNE Auctions English Auction Second-Price Sealed-Bid Auction First-Price Sealed-Bid Auction Today Applications of NE and SPNE Auctions English Auction Second-Price Sealed-Bid Auction First-Price Sealed-Bid Auction 2 / 26 Auctions Used to allocate: Art Government bonds Radio spectrum Forms: Sequential

More information

HW Consider the following game:

HW Consider the following game: HW 1 1. Consider the following game: 2. HW 2 Suppose a parent and child play the following game, first analyzed by Becker (1974). First child takes the action, A 0, that produces income for the child,

More information

Multiunit Auctions: Package Bidding October 24, Multiunit Auctions: Package Bidding

Multiunit Auctions: Package Bidding October 24, Multiunit Auctions: Package Bidding Multiunit Auctions: Package Bidding 1 Examples of Multiunit Auctions Spectrum Licenses Bus Routes in London IBM procurements Treasury Bills Note: Heterogenous vs Homogenous Goods 2 Challenges in Multiunit

More information

Secret Reserve Price in a e-ascending Auction

Secret Reserve Price in a e-ascending Auction Secret Reserve Price in a e-ascending Auction Karine Brisset and Florence Naegelen y CRESE, UFR de droit et de sciences économiques, 45D Avenue de l observatoire 5030 Besançon cedex. March 004 Abstract

More information

General Examination in Microeconomic Theory SPRING 2014

General Examination in Microeconomic Theory SPRING 2014 HARVARD UNIVERSITY DEPARTMENT OF ECONOMICS General Examination in Microeconomic Theory SPRING 2014 You have FOUR hours. Answer all questions Those taking the FINAL have THREE hours Part A (Glaeser): 55

More information

6.254 : Game Theory with Engineering Applications Lecture 3: Strategic Form Games - Solution Concepts

6.254 : Game Theory with Engineering Applications Lecture 3: Strategic Form Games - Solution Concepts 6.254 : Game Theory with Engineering Applications Lecture 3: Strategic Form Games - Solution Concepts Asu Ozdaglar MIT February 9, 2010 1 Introduction Outline Review Examples of Pure Strategy Nash Equilibria

More information

Ideal Bootstrapping and Exact Recombination: Applications to Auction Experiments

Ideal Bootstrapping and Exact Recombination: Applications to Auction Experiments Ideal Bootstrapping and Exact Recombination: Applications to Auction Experiments Carl T. Bergstrom University of Washington, Seattle, WA Theodore C. Bergstrom University of California, Santa Barbara Rodney

More information

Secret reserve prices in first price auctions

Secret reserve prices in first price auctions Secret reserve prices in first price auctions (This version: May 27, 2014) Frank Rosar Department of Economics, University of Bonn, Lennéstr. 37, 53113 Bonn, Germany. Tel.: + 49 228 73 6192. Fax: + 49

More information

An Ascending Double Auction

An Ascending Double Auction An Ascending Double Auction Michael Peters and Sergei Severinov First Version: March 1 2003, This version: January 25 2007 Abstract We show why the failure of the affiliation assumption prevents the double

More information

Strategy -1- Strategy

Strategy -1- Strategy Strategy -- Strategy A Duopoly, Cournot equilibrium 2 B Mixed strategies: Rock, Scissors, Paper, Nash equilibrium 5 C Games with private information 8 D Additional exercises 24 25 pages Strategy -2- A

More information

Signaling in an English Auction: Ex ante versus Interim Analysis

Signaling in an English Auction: Ex ante versus Interim Analysis Signaling in an English Auction: Ex ante versus Interim Analysis Peyman Khezr School of Economics University of Sydney and Abhijit Sengupta School of Economics University of Sydney Abstract This paper

More information

Auctions and Optimal Bidding

Auctions and Optimal Bidding Auctions and Optimal Bidding Professor B. Espen Dartmouth and NHH 2010 Agenda Examples of auctions Bidding in private value auctions Bidding with termination fees and toeholds Bidding in common value auctions

More information

Commitment in First-price Auctions

Commitment in First-price Auctions Commitment in First-price Auctions Yunjian Xu and Katrina Ligett November 12, 2014 Abstract We study a variation of the single-item sealed-bid first-price auction wherein one bidder (the leader) publicly

More information

Practice Problems. U(w, e) = p w e 2,

Practice Problems. U(w, e) = p w e 2, Practice Problems Information Economics (Ec 515) George Georgiadis Problem 1. Static Moral Hazard Consider an agency relationship in which the principal contracts with the agent. The monetary result of

More information

Buyback Auctions for Fisheries Management. Guilherme de Freitas, OpenX Ted Groves, UCSD John Ledyard, Caltech Brian Merlob, Caltech

Buyback Auctions for Fisheries Management. Guilherme de Freitas, OpenX Ted Groves, UCSD John Ledyard, Caltech Brian Merlob, Caltech Buyback Auctions for Fisheries Management Guilherme de Freitas, OpenX Ted Groves, UCSD John Ledyard, Caltech Brian Merlob, Caltech Background Many, if not most, national and international fisheries are

More information

Auctioning a Single Item. Auctions. Simple Auctions. Simple Auctions. Models of Private Information. Models of Private Information

Auctioning a Single Item. Auctions. Simple Auctions. Simple Auctions. Models of Private Information. Models of Private Information Auctioning a Single Item Auctions Auctions and Competitive Bidding McAfee and McMillan (Journal of Economic Literature, 987) Milgrom and Weber (Econometrica, 982) 450% of the world GNP is traded each year

More information

Auctions 1: Common auctions & Revenue equivalence & Optimal mechanisms. 1 Notable features of auctions. use. A lot of varieties.

Auctions 1: Common auctions & Revenue equivalence & Optimal mechanisms. 1 Notable features of auctions. use. A lot of varieties. 1 Notable features of auctions Ancient market mechanisms. use. A lot of varieties. Widespread in Auctions 1: Common auctions & Revenue equivalence & Optimal mechanisms Simple and transparent games (mechanisms).

More information

Sequential information disclosure in auctions

Sequential information disclosure in auctions Available online at www.sciencedirect.com ScienceDirect Journal of Economic Theory 159 2015) 1074 1095 www.elsevier.com/locate/jet Sequential information disclosure in auctions Dirk Bergemann a,, Achim

More information

Optimal auctions with endogenous budgets

Optimal auctions with endogenous budgets Optimal auctions with endogenous budgets Brian Baisa and Stanisla Rabinoich September 14, 2015 Abstract We study the benchmark independent priate alue auction setting when bidders hae endogenously determined

More information

Game Theory Lecture #16

Game Theory Lecture #16 Game Theory Lecture #16 Outline: Auctions Mechanism Design Vickrey-Clarke-Groves Mechanism Optimizing Social Welfare Goal: Entice players to select outcome which optimizes social welfare Examples: Traffic

More information

Stochastic Games and Bayesian Games

Stochastic Games and Bayesian Games Stochastic Games and Bayesian Games CPSC 532l Lecture 10 Stochastic Games and Bayesian Games CPSC 532l Lecture 10, Slide 1 Lecture Overview 1 Recap 2 Stochastic Games 3 Bayesian Games 4 Analyzing Bayesian

More information

SEQUENTIAL INFORMATION DISCLOSURE IN AUCTIONS. Dirk Bergemann and Achim Wambach. July 2013 Revised October 2014

SEQUENTIAL INFORMATION DISCLOSURE IN AUCTIONS. Dirk Bergemann and Achim Wambach. July 2013 Revised October 2014 SEQUENTIAL INFORMATION DISCLOSURE IN AUCTIONS By Dirk Bergemann and Achim Wambach July 2013 Revised October 2014 COWLES FOUNDATION DISCUSSION PAPER NO. 1900R COWLES FOUNDATION FOR RESEARCH IN ECONOMICS

More information

Sequential-move games with Nature s moves.

Sequential-move games with Nature s moves. Econ 221 Fall, 2018 Li, Hao UBC CHAPTER 3. GAMES WITH SEQUENTIAL MOVES Game trees. Sequential-move games with finite number of decision notes. Sequential-move games with Nature s moves. 1 Strategies in

More information

Mechanism Design and Auctions

Mechanism Design and Auctions Mechanism Design and Auctions Game Theory Algorithmic Game Theory 1 TOC Mechanism Design Basics Myerson s Lemma Revenue-Maximizing Auctions Near-Optimal Auctions Multi-Parameter Mechanism Design and the

More information

This is the author s final accepted version.

This is the author s final accepted version. Eichberger, J. and Vinogradov, D. (2016) Efficiency of Lowest-Unmatched Price Auctions. Economics Letters, 141, pp. 98-102. (doi:10.1016/j.econlet.2016.02.012) This is the author s final accepted version.

More information

Experiments on Auctions

Experiments on Auctions Experiments on Auctions Syngjoo Choi Spring, 2010 Experimental Economics (ECON3020) Auction Spring, 2010 1 / 25 Auctions An auction is a process of buying and selling commodities by taking bids and assigning

More information

Subjects: What is an auction? Auction formats. True values & known values. Relationships between auction formats

Subjects: What is an auction? Auction formats. True values & known values. Relationships between auction formats Auctions Subjects: What is an auction? Auction formats True values & known values Relationships between auction formats Auctions as a game and strategies to win. All-pay auctions What is an auction? An

More information

On Forchheimer s Model of Dominant Firm Price Leadership

On Forchheimer s Model of Dominant Firm Price Leadership On Forchheimer s Model of Dominant Firm Price Leadership Attila Tasnádi Department of Mathematics, Budapest University of Economic Sciences and Public Administration, H-1093 Budapest, Fővám tér 8, Hungary

More information

Problem Set 3: Suggested Solutions

Problem Set 3: Suggested Solutions Microeconomics: Pricing 3E Fall 5. True or false: Problem Set 3: Suggested Solutions (a) Since a durable goods monopolist prices at the monopoly price in her last period of operation, the prices must be

More information

Sequential Auctions and Auction Revenue

Sequential Auctions and Auction Revenue Sequential Auctions and Auction Revenue David J. Salant Toulouse School of Economics and Auction Technologies Luís Cabral New York University November 2018 Abstract. We consider the problem of a seller

More information

Sequential Auctions, Price Trends, and Risk Preferences

Sequential Auctions, Price Trends, and Risk Preferences ,, and Risk Preferences Audrey Hu Liang Zou University of Amsterdam/ Tinbergen Institute 15 February, 2015 auctions are market institutions where multiple units of (nearly) identical goods are sold one

More information

Auction Theory: Some Basics

Auction Theory: Some Basics Auction Theory: Some Basics Arunava Sen Indian Statistical Institute, New Delhi ICRIER Conference on Telecom, March 7, 2014 Outline Outline Single Good Problem Outline Single Good Problem First Price Auction

More information

Auction theory. Filip An. U.U.D.M. Project Report 2018:35. Department of Mathematics Uppsala University

Auction theory. Filip An. U.U.D.M. Project Report 2018:35. Department of Mathematics Uppsala University U.U.D.M. Project Report 28:35 Auction theory Filip An Examensarbete i matematik, 5 hp Handledare: Erik Ekström Examinator: Veronica Crispin Quinonez Augusti 28 Department of Mathematics Uppsala University

More information

Bayesian games and their use in auctions. Vincent Conitzer

Bayesian games and their use in auctions. Vincent Conitzer Bayesian games and their use in auctions Vincent Conitzer conitzer@cs.duke.edu What is mechanism design? In mechanism design, we get to design the game (or mechanism) e.g. the rules of the auction, marketplace,

More information

Blind Portfolio Auctions via Intermediaries

Blind Portfolio Auctions via Intermediaries Blind Portfolio Auctions via Intermediaries Michael Padilla Stanford University (joint work with Benjamin Van Roy) April 12, 2011 Computer Forum 2011 Michael Padilla (Stanford University) Blind Portfolio

More information

Incomplete contracts and optimal ownership of public goods

Incomplete contracts and optimal ownership of public goods MPRA Munich Personal RePEc Archive Incomplete contracts and optimal ownership of public goods Patrick W. Schmitz September 2012 Online at https://mpra.ub.uni-muenchen.de/41730/ MPRA Paper No. 41730, posted

More information

Lecture 5: Iterative Combinatorial Auctions

Lecture 5: Iterative Combinatorial Auctions COMS 6998-3: Algorithmic Game Theory October 6, 2008 Lecture 5: Iterative Combinatorial Auctions Lecturer: Sébastien Lahaie Scribe: Sébastien Lahaie In this lecture we examine a procedure that generalizes

More information

Limitations of Dominance and Forward Induction: Experimental Evidence *

Limitations of Dominance and Forward Induction: Experimental Evidence * Limitations of Dominance and Forward Induction: Experimental Evidence * Jordi Brandts Instituto de Análisis Económico (CSIC), Barcelona, Spain Charles A. Holt University of Virginia, Charlottesville VA,

More information

Second-chance offers

Second-chance offers Second-chance offers By Rodney J. Garratt and Thomas Tröger February 20, 2013 Abstract We study the second-price offer feature of ebay auctions in which the seller has multiple units. Perhaps surprisingly,

More information

Auctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University

Auctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University Auctions Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University AE4M36MAS Autumn 2015 - Lecture 12 Where are We? Agent architectures (inc. BDI

More information

Information and Evidence in Bargaining

Information and Evidence in Bargaining Information and Evidence in Bargaining Péter Eső Department of Economics, University of Oxford peter.eso@economics.ox.ac.uk Chris Wallace Department of Economics, University of Leicester cw255@leicester.ac.uk

More information

MA200.2 Game Theory II, LSE

MA200.2 Game Theory II, LSE MA200.2 Game Theory II, LSE Problem Set 1 These questions will go over basic game-theoretic concepts and some applications. homework is due during class on week 4. This [1] In this problem (see Fudenberg-Tirole

More information

Price Discrimination As Portfolio Diversification. Abstract

Price Discrimination As Portfolio Diversification. Abstract Price Discrimination As Portfolio Diversification Parikshit Ghosh Indian Statistical Institute Abstract A seller seeking to sell an indivisible object can post (possibly different) prices to each of n

More information

Internet Trading Mechanisms and Rational Expectations

Internet Trading Mechanisms and Rational Expectations Internet Trading Mechanisms and Rational Expectations Michael Peters and Sergei Severinov University of Toronto and Duke University First Version -Feb 03 April 1, 2003 Abstract This paper studies an internet

More information

Auction. Li Zhao, SJTU. Spring, Li Zhao Auction 1 / 35

Auction. Li Zhao, SJTU. Spring, Li Zhao Auction 1 / 35 Auction Li Zhao, SJTU Spring, 2017 Li Zhao Auction 1 / 35 Outline 1 A Simple Introduction to Auction Theory 2 Estimating English Auction 3 Estimating FPA Li Zhao Auction 2 / 35 Background Auctions have

More information

A Decentralized Learning Equilibrium

A Decentralized Learning Equilibrium Paper to be presented at the DRUID Society Conference 2014, CBS, Copenhagen, June 16-18 A Decentralized Learning Equilibrium Andreas Blume University of Arizona Economics ablume@email.arizona.edu April

More information

Auctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University

Auctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University Auctions Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University AE4M36MAS Autumn 2014 - Lecture 12 Where are We? Agent architectures (inc. BDI

More information

The English Auction, Rushes, and a Sealed Bid Efficient Auction

The English Auction, Rushes, and a Sealed Bid Efficient Auction The English Auction, Rushes, and a Sealed Bid Efficient Auction Ángel Hernando-Veciana Universidad Carlos III de Madrid Fabio Michelucci CERGE-EI January 31, 212 Abstract We analyze an auction setting

More information

International Journal of Industrial Organization

International Journal of Industrial Organization International Journal of Industrial Organization 8 (010) 451 463 Contents lists available at ScienceDirect International Journal of Industrial Organization journal homepage: www.elsevier.com/locate/ijio

More information

Microeconomic Theory II Preliminary Examination Solutions Exam date: August 7, 2017

Microeconomic Theory II Preliminary Examination Solutions Exam date: August 7, 2017 Microeconomic Theory II Preliminary Examination Solutions Exam date: August 7, 017 1. Sheila moves first and chooses either H or L. Bruce receives a signal, h or l, about Sheila s behavior. The distribution

More information

Lecture 6 Applications of Static Games of Incomplete Information

Lecture 6 Applications of Static Games of Incomplete Information Lecture 6 Applications of Static Games of Incomplete Information Good to be sold at an auction. Which auction design should be used in order to maximize expected revenue for the seller, if the bidders

More information

Mechanism Design and Auctions

Mechanism Design and Auctions Multiagent Systems (BE4M36MAS) Mechanism Design and Auctions Branislav Bošanský and Michal Pěchouček Artificial Intelligence Center, Department of Computer Science, Faculty of Electrical Engineering, Czech

More information

Optimal selling rules for repeated transactions.

Optimal selling rules for repeated transactions. Optimal selling rules for repeated transactions. Ilan Kremer and Andrzej Skrzypacz March 21, 2002 1 Introduction In many papers considering the sale of many objects in a sequence of auctions the seller

More information

Budget Management In GSP (2018)

Budget Management In GSP (2018) Budget Management In GSP (2018) Yahoo! March 18, 2018 Miguel March 18, 2018 1 / 26 Today s Presentation: Budget Management Strategies in Repeated auctions, Balseiro, Kim, and Mahdian, WWW2017 Learning

More information

The Impact of a Right of First Refusal Clause in a First-Price Auction with Unknown Heterogeneous Risk-Aversion

The Impact of a Right of First Refusal Clause in a First-Price Auction with Unknown Heterogeneous Risk-Aversion The Impact of a Right of First Refusal Clause in a First-Price Auction with Unknown Heterogeneous Risk-Aversion Karine Brisset, François Cochard and François Maréchal January 2017 Abstract We consider

More information

6.207/14.15: Networks Lecture 10: Introduction to Game Theory 2

6.207/14.15: Networks Lecture 10: Introduction to Game Theory 2 6.207/14.15: Networks Lecture 10: Introduction to Game Theory 2 Daron Acemoglu and Asu Ozdaglar MIT October 14, 2009 1 Introduction Outline Review Examples of Pure Strategy Nash Equilibria Mixed Strategies

More information

ECO 426 (Market Design) - Lecture 8

ECO 426 (Market Design) - Lecture 8 ECO 426 (Market Design) - Lecture 8 Ettore Damiano November 23, 2015 Revenue equivalence Model: N bidders Bidder i has valuation v i Each v i is drawn independently from the same distribution F (e.g. U[0,

More information

Countering the Winner s Curse: Optimal Auction Design in a Common Value Model

Countering the Winner s Curse: Optimal Auction Design in a Common Value Model Countering the Winner s Curse: Optimal Auction Design in a Common Value Model Dirk Bergemann Benjamin Brooks Stephen Morris November 16, 2018 Abstract We characterize revenue maximizing mechanisms in a

More information

Econ 2230: Public Economics. Lecture 15: Fundraising: Lotteries

Econ 2230: Public Economics. Lecture 15: Fundraising: Lotteries Econ 2230: Public Economics Lecture 15: Fundraising: Lotteries Lotteries 1. Overview of lotteries 2. Theory of voluntary provision through lotteries (Morgan, 2000) 3. Experimental evidence of lottery effect

More information

PAULI MURTO, ANDREY ZHUKOV. If any mistakes or typos are spotted, kindly communicate them to

PAULI MURTO, ANDREY ZHUKOV. If any mistakes or typos are spotted, kindly communicate them to GAME THEORY PROBLEM SET 1 WINTER 2018 PAULI MURTO, ANDREY ZHUKOV Introduction If any mistakes or typos are spotted, kindly communicate them to andrey.zhukov@aalto.fi. Materials from Osborne and Rubinstein

More information

Microeconomics Comprehensive Exam

Microeconomics Comprehensive Exam Microeconomics Comprehensive Exam June 2009 Instructions: (1) Please answer each of the four questions on separate pieces of paper. (2) When finished, please arrange your answers alphabetically (in the

More information

Web Appendix: Proofs and extensions.

Web Appendix: Proofs and extensions. B eb Appendix: Proofs and extensions. B.1 Proofs of results about block correlated markets. This subsection provides proofs for Propositions A1, A2, A3 and A4, and the proof of Lemma A1. Proof of Proposition

More information

Gathering Information before Signing a Contract: a New Perspective

Gathering Information before Signing a Contract: a New Perspective Gathering Information before Signing a Contract: a New Perspective Olivier Compte and Philippe Jehiel November 2003 Abstract A principal has to choose among several agents to fulfill a task and then provide

More information

CUR 412: Game Theory and its Applications, Lecture 4

CUR 412: Game Theory and its Applications, Lecture 4 CUR 412: Game Theory and its Applications, Lecture 4 Prof. Ronaldo CARPIO March 27, 2015 Homework #1 Homework #1 will be due at the end of class today. Please check the website later today for the solutions

More information

Dissolving a Partnership Securely

Dissolving a Partnership Securely Dissolving a Partnership Securely Matt Van Essen John Wooders February 27, 2017 Abstract We characterize security strategies and payoffs for three mechanisms for dissolving partnerships: the Texas Shoot-Out,

More information

Competition and risk taking in a differentiated banking sector

Competition and risk taking in a differentiated banking sector Competition and risk taking in a differentiated banking sector Martín Basurto Arriaga Tippie College of Business, University of Iowa Iowa City, IA 54-1994 Kaniṣka Dam Centro de Investigación y Docencia

More information