Gateway to Think Tanks
来源类型 | Discussion paper |
规范类型 | 论文 |
来源ID | DP6439 |
DP6439 The Dynamic Assignment of Heterogenous Objects: A Mechanism Design Approach | |
Benny Moldovanu; Alex Gershkov | |
发表日期 | 2007-08-24 |
出版年 | 2007 |
语种 | 英语 |
摘要 | We set up a duopoly model with dynamic capacity constraints under demand uncertainty. We endogenize the investment decisions of the firms, examine their intertemporal pricing behavior, their incentives to merge, as well as the welfare implications of a merger. Whereas under known and constant demand the high capacity firm lets its low capacity rival sell out, under demand uncertainty we obtain a rich set of sales patterns. Each unit of available capacity has an option value (or opportunity cost), which depends on both firms' capacities, the current demand and the remaining horizon. This option value may be higher when the firms act non-cooperatively compared to the case when they merge to form a monopoly. Trade surplus may be higher when a merger takes place, as capacity is more efficiently managed over time. The prospect of a merger also leads to higher investment levels, as each firm wishes to appropriate a higher share of the total surplus. For some levels of the capacity instalment cost, a merger that turns the duopoly into a monopoly is welfare improving. |
主题 | Industrial Organization |
关键词 | Capacity constraints Dynamic oligopoly Inventories Mergers Price competition |
URL | https://cepr.org/publications/dp6439 |
来源智库 | Centre for Economic Policy Research (United Kingdom) |
资源类型 | 智库出版物 |
条目标识符 | http://119.78.100.153/handle/2XGU8XDN/535276 |
推荐引用方式 GB/T 7714 | Benny Moldovanu,Alex Gershkov. DP6439 The Dynamic Assignment of Heterogenous Objects: A Mechanism Design Approach. 2007. |
条目包含的文件 | 条目无相关文件。 |
个性服务 |
推荐该条目 |
保存到收藏夹 |
导出为Endnote文件 |
谷歌学术 |
谷歌学术中相似的文章 |
[Benny Moldovanu]的文章 |
[Alex Gershkov]的文章 |
百度学术 |
百度学术中相似的文章 |
[Benny Moldovanu]的文章 |
[Alex Gershkov]的文章 |
必应学术 |
必应学术中相似的文章 |
[Benny Moldovanu]的文章 |
[Alex Gershkov]的文章 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。