語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Essays in Economic Theory.
~
Sinander, Carl Martin Ludvig.
FindBook
Google Book
Amazon
博客來
Essays in Economic Theory.
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Essays in Economic Theory./
作者:
Sinander, Carl Martin Ludvig.
出版者:
Ann Arbor : ProQuest Dissertations & Theses, : 2021,
面頁冊數:
284 p.
附註:
Source: Dissertations Abstracts International, Volume: 83-01, Section: B.
Contained By:
Dissertations Abstracts International83-01B.
標題:
Systems science. -
電子資源:
https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28413963
ISBN:
9798516063756
Essays in Economic Theory.
Sinander, Carl Martin Ludvig.
Essays in Economic Theory.
- Ann Arbor : ProQuest Dissertations & Theses, 2021 - 284 p.
Source: Dissertations Abstracts International, Volume: 83-01, Section: B.
Thesis (Ph.D.)--Northwestern University, 2021.
This item must not be sold to any third party vendors.
This dissertation comprises three essays in distinct areas of economic theory.The first chapter is co-authored with Gregorio Curello. We identify a new and pervasive dynamic agency problem: that of incentivising the prompt disclosure of productive information. To study it, we introduce a model in which a technological breakthrough occurs at an uncertain time and is privately observed by an agent, and a principal must incentivise disclosure via her control of the agent's utility. We uncover a striking deadline structure of optimal mechanisms: they have a simple deadline form in an important special case, and a graduated deadline structure in general. We apply our results to the design of unemployment insurance schemes.In the second chapter, I prove an envelope theorem with a converse: the envelope formula is equivalent to a first-order condition. Like Milgrom and Segal's (2002) envelope theorem, my result requires no structure on the choice set. I use the converse envelope theorem to extend to abstract outcomes the canonical result in mechanism design that any increasing allocation is implementable, and apply this to selling information.The final chapter, also co-authored with Gregorio Curello, concerns collective decision-making. A committee ranks a set of alternatives by sequentially voting on pairs, in an order chosen by the committee's chair. Although the chair has no knowledge of voters' preferences, we show that she can do as well as if she had perfect information. We characterise strategies with this 'regret-freeness' property in two ways: (1) they are efficient, and (2) they avoid two intuitive errors. One regret-free strategy is a sorting algorithm called insertion sort. We show that it is characterised by a lexicographic property, and is outcome-equivalent to a recursive variant of the much-studied amendment procedure.
ISBN: 9798516063756Subjects--Topical Terms:
3168411
Systems science.
Subjects--Index Terms:
Collective decision making
Essays in Economic Theory.
LDR
:03031nmm a2200385 4500
001
2285197
005
20211129124004.5
008
220723s2021 ||||||||||||||||| ||eng d
020
$a
9798516063756
035
$a
(MiAaPQ)AAI28413963
035
$a
AAI28413963
040
$a
MiAaPQ
$c
MiAaPQ
100
1
$a
Sinander, Carl Martin Ludvig.
$0
(orcid)0000-0002-3708-1233
$3
3564487
245
1 0
$a
Essays in Economic Theory.
260
1
$a
Ann Arbor :
$b
ProQuest Dissertations & Theses,
$c
2021
300
$a
284 p.
500
$a
Source: Dissertations Abstracts International, Volume: 83-01, Section: B.
500
$a
Advisor: Dekel, Eddie.
502
$a
Thesis (Ph.D.)--Northwestern University, 2021.
506
$a
This item must not be sold to any third party vendors.
520
$a
This dissertation comprises three essays in distinct areas of economic theory.The first chapter is co-authored with Gregorio Curello. We identify a new and pervasive dynamic agency problem: that of incentivising the prompt disclosure of productive information. To study it, we introduce a model in which a technological breakthrough occurs at an uncertain time and is privately observed by an agent, and a principal must incentivise disclosure via her control of the agent's utility. We uncover a striking deadline structure of optimal mechanisms: they have a simple deadline form in an important special case, and a graduated deadline structure in general. We apply our results to the design of unemployment insurance schemes.In the second chapter, I prove an envelope theorem with a converse: the envelope formula is equivalent to a first-order condition. Like Milgrom and Segal's (2002) envelope theorem, my result requires no structure on the choice set. I use the converse envelope theorem to extend to abstract outcomes the canonical result in mechanism design that any increasing allocation is implementable, and apply this to selling information.The final chapter, also co-authored with Gregorio Curello, concerns collective decision-making. A committee ranks a set of alternatives by sequentially voting on pairs, in an order chosen by the committee's chair. Although the chair has no knowledge of voters' preferences, we show that she can do as well as if she had perfect information. We characterise strategies with this 'regret-freeness' property in two ways: (1) they are efficient, and (2) they avoid two intuitive errors. One regret-free strategy is a sorting algorithm called insertion sort. We show that it is characterised by a lexicographic property, and is outcome-equivalent to a recursive variant of the much-studied amendment procedure.
590
$a
School code: 0163.
650
4
$a
Systems science.
$3
3168411
653
$a
Collective decision making
653
$a
Dynamic agency
653
$a
Incentives
653
$a
Envelope theorem
653
$a
First order condition
653
$a
Disclosure of productive information
690
$a
0511
690
$a
0501
690
$a
0790
710
2
$a
Northwestern University.
$b
Economics.
$3
1020895
773
0
$t
Dissertations Abstracts International
$g
83-01B.
790
$a
0163
791
$a
Ph.D.
792
$a
2021
793
$a
English
856
4 0
$u
https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28413963
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9436930
電子資源
11.線上閱覽_V
電子書
EB
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入