Essays on behavioral mechanism design행동경제학과 메커니즘 설계 이론

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 187
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorHwang, Sung-Ha-
dc.contributor.advisor황성하-
dc.contributor.authorBaik, Sosung-
dc.date.accessioned2023-06-21T19:33:06Z-
dc.date.available2023-06-21T19:33:06Z-
dc.date.issued2023-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=1032131&flag=dissertationen_US
dc.identifier.urihttp://hdl.handle.net/10203/307818-
dc.description학위논문(박사) - 한국과학기술원 : 경영공학부, 2023.2,[iv, 82 p. :]-
dc.description.abstractThis collection of essays studies auctions with ambiguity. In the first chapter, we study the revenue comparison problem of auctions when the seller has a maxmin expected utility preference. The seller holds a set of priors around some reference belief, interpreted as an approximating model of the true probability law or the focal point distribution. We develop a methodology for comparing the revenue performances of auctions: the seller prefers auction X to auction Y if their transfer functions satisfy a weak form of the single-crossing condition. Intuitively, this condition means that a bidder's payment is more negatively associated with the competitor's type in X than in Y. Applying this methodology, we show that when the reference belief is independent and identically distributed (IID) and the bidders are ambiguity neutral, (i) the first-price auction outperforms the second-price and all-pay auctions, and (ii) the second-price and all-pay auctions outperform the war of attrition. Our methodology yields results opposite to those of the Linkage Principle. The second chapter studies the optimal auction design problem when bidders have maxmin expected utility preferences. Existing literature shows that a full insurance auction is optimal-
dc.description.abstracthowever, in practice, losing bidders receive no premiums or only partial premiums. Motivated by this observation, we suppose the maximum possible premium that the seller can provide to a bidder is limited by a certain amount. For a given allocation rule, we identify a set of optimal transfer candidates, named the win-lose dependent transfers, with the following property: each type of bidder's transfer conditional on winning or losing is independent of the competitor's type report. Our result reduces the infinite-dimensional optimal transfer problem to a two-dimensional optimization problem. By solving the reduced problem, we find that among efficient mechanisms with no premiums, the first-price auction is optimal. Under a simplifying assumption, the first-price auction with a suitable reserve price remains optimal under the endogenous allocation rule.-
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectAuctions▼aAmbiguity▼aRevenue comparison▼aMechanism design-
dc.subject경매▼a모호성▼a수입 비교▼a메커니즘 설계-
dc.titleEssays on behavioral mechanism design-
dc.title.alternative행동경제학과 메커니즘 설계 이론-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN325007-
dc.description.department한국과학기술원 :경영공학부,-
dc.contributor.alternativeauthor백소성-
Appears in Collection
MT-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0