Three Essays in Economics

abstract: This dissertation presents three essays in economics. Firstly, I study the problem of allocating an indivisible good between two agents under incomplete information. I provide a characterization of mechanisms that maximize the sum of the expected utilities of the agents among all feasible...

Full description

Bibliographic Details
Other Authors: Shao, Ran (Author)
Format: Doctoral Thesis
Language:English
Published: 2011
Subjects:
Online Access:http://hdl.handle.net/2286/R.I.9283
id ndltd-asu.edu-item-9283
record_format oai_dc
spelling ndltd-asu.edu-item-92832018-06-22T03:01:53Z Three Essays in Economics abstract: This dissertation presents three essays in economics. Firstly, I study the problem of allocating an indivisible good between two agents under incomplete information. I provide a characterization of mechanisms that maximize the sum of the expected utilities of the agents among all feasible strategy-proof mechanisms: Any optimal mechanism must be a convex combination of two fixed price mechanisms and two option mechanisms. Secondly, I study the problem of allocating a non-excludable public good between two agents under incomplete information. An equal-cost sharing mechanism which maximizes the sum of the expected utilities of the agents among all feasible strategy-proof mechanisms is proved to be optimal. Under the equal-cost sharing mechanism, when the built cost is low, the public good is provided whenever one of the agents is willing to fund it at half cost; when the cost is high, the public good is provided only if both agents are willing to fund it. Thirdly, I analyze the problem of matching two heterogeneous populations. If the payoff from a match exhibits complementarities, it is well known that absent any friction positive assortative matching is optimal. Coarse matching refers to a situation in which the populations into a finite number of classes, then randomly matched within these classes. The focus of this essay is the performance of coarse matching schemes with a finite number of classes. The main results of this essay are the following ones. First, assuming a multiplicative match payoff function, I derive a lower bound on the performance of n-class coarse matching under mild conditions on the distributions of agents' characteristics. Second, I prove that this result generalizes to a large class of match payoff functions. Third, I show that these results are applicable to a broad class of applications, including a monopoly pricing problem with incomplete information, as well as to a cost-sharing problem with incomplete information. In these problems, standard models predict that optimal contracts sort types completely. The third result implies that a monopolist can capture a large fraction of the second-best profits by offering pooling contracts with a small number of qualities. Dissertation/Thesis Shao, Ran (Author) Manelli, Alejandro (Advisor) Chade, Hector (Advisor) Schlee, Edward (Committee member) Kovrijnykh, Natalia (Committee member) Arizona State University (Publisher) Economic Theory Auction Matching Mechanism Design eng 125 pages Ph.D. Economics 2011 Doctoral Dissertation http://hdl.handle.net/2286/R.I.9283 http://rightsstatements.org/vocab/InC/1.0/ All Rights Reserved 2011
collection NDLTD
language English
format Doctoral Thesis
sources NDLTD
topic Economic Theory
Auction
Matching
Mechanism Design
spellingShingle Economic Theory
Auction
Matching
Mechanism Design
Three Essays in Economics
description abstract: This dissertation presents three essays in economics. Firstly, I study the problem of allocating an indivisible good between two agents under incomplete information. I provide a characterization of mechanisms that maximize the sum of the expected utilities of the agents among all feasible strategy-proof mechanisms: Any optimal mechanism must be a convex combination of two fixed price mechanisms and two option mechanisms. Secondly, I study the problem of allocating a non-excludable public good between two agents under incomplete information. An equal-cost sharing mechanism which maximizes the sum of the expected utilities of the agents among all feasible strategy-proof mechanisms is proved to be optimal. Under the equal-cost sharing mechanism, when the built cost is low, the public good is provided whenever one of the agents is willing to fund it at half cost; when the cost is high, the public good is provided only if both agents are willing to fund it. Thirdly, I analyze the problem of matching two heterogeneous populations. If the payoff from a match exhibits complementarities, it is well known that absent any friction positive assortative matching is optimal. Coarse matching refers to a situation in which the populations into a finite number of classes, then randomly matched within these classes. The focus of this essay is the performance of coarse matching schemes with a finite number of classes. The main results of this essay are the following ones. First, assuming a multiplicative match payoff function, I derive a lower bound on the performance of n-class coarse matching under mild conditions on the distributions of agents' characteristics. Second, I prove that this result generalizes to a large class of match payoff functions. Third, I show that these results are applicable to a broad class of applications, including a monopoly pricing problem with incomplete information, as well as to a cost-sharing problem with incomplete information. In these problems, standard models predict that optimal contracts sort types completely. The third result implies that a monopolist can capture a large fraction of the second-best profits by offering pooling contracts with a small number of qualities. === Dissertation/Thesis === Ph.D. Economics 2011
author2 Shao, Ran (Author)
author_facet Shao, Ran (Author)
title Three Essays in Economics
title_short Three Essays in Economics
title_full Three Essays in Economics
title_fullStr Three Essays in Economics
title_full_unstemmed Three Essays in Economics
title_sort three essays in economics
publishDate 2011
url http://hdl.handle.net/2286/R.I.9283
_version_ 1718699668362231808