具有简单菜单的最佳机制

Zihe Wang, Pingzhong Tang
{"title":"具有简单菜单的最佳机制","authors":"Zihe Wang, Pingzhong Tang","doi":"10.1145/2600057.2602863","DOIUrl":null,"url":null,"abstract":"We consider revenue-optimal mechanism design for the case with one buyer and two items. The buyer's valuations towards the two items are independent and additive. In this setting, optimal mechanism is unknown for general valuation distributions. We obtain two categories of structural results that shed light on the optimal mechanisms. These results can be summarized into one conclusion: under certain conditions, the optimal mechanisms have simple menus. The first category of results state that, under a centain condition, the optimal mechanism has a monotone menu. In other words, in the menu that represents the optimal mechanism, as payment increases, the allocation probabilities for both items increase simultaneously. This theorem complements Hart and Reny's recent result regarding the nonmonotonicity of menu and revenue in multi-item settings. Applying this theorem, we derive a version of revenue monotonicity theorem that states stochastically superior distributions yield more revenue. Moreover, our theorem subsumes a previous result regarding sufficient conditions under which bundling is optimal[Hart and Nisan 2012]. The second category of results state that, under certain conditions, the optimal mechanisms have few menu items. Our first result in this category says that, for certain distributions, the optimal menu contains at most 4 items. The condition admits power (including uniform) density functions. Our second result in this category works for a weaker (hence more general) condition, under which the optimal menu contains at most 6 items. This condition is general enough to include a wide variety of density functions, such as exponential functions and any function whose Taylor series coefficients are nonnegative. Our last result in this category works for unit-demand setting. It states that, for uniform distributions, the optimal menu contains at most 5 items. All these results are in sharp contrast to Hart and Nisan's recent result that finite-sized menu cannot guarantee any positive fraction of optimal revenue for correlated valuation distributions.","PeriodicalId":203155,"journal":{"name":"Proceedings of the fifteenth ACM conference on Economics and computation","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"58","resultStr":"{\"title\":\"Optimal mechanisms with simple menus\",\"authors\":\"Zihe Wang, Pingzhong Tang\",\"doi\":\"10.1145/2600057.2602863\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider revenue-optimal mechanism design for the case with one buyer and two items. The buyer's valuations towards the two items are independent and additive. In this setting, optimal mechanism is unknown for general valuation distributions. We obtain two categories of structural results that shed light on the optimal mechanisms. These results can be summarized into one conclusion: under certain conditions, the optimal mechanisms have simple menus. The first category of results state that, under a centain condition, the optimal mechanism has a monotone menu. In other words, in the menu that represents the optimal mechanism, as payment increases, the allocation probabilities for both items increase simultaneously. This theorem complements Hart and Reny's recent result regarding the nonmonotonicity of menu and revenue in multi-item settings. Applying this theorem, we derive a version of revenue monotonicity theorem that states stochastically superior distributions yield more revenue. Moreover, our theorem subsumes a previous result regarding sufficient conditions under which bundling is optimal[Hart and Nisan 2012]. The second category of results state that, under certain conditions, the optimal mechanisms have few menu items. Our first result in this category says that, for certain distributions, the optimal menu contains at most 4 items. The condition admits power (including uniform) density functions. Our second result in this category works for a weaker (hence more general) condition, under which the optimal menu contains at most 6 items. This condition is general enough to include a wide variety of density functions, such as exponential functions and any function whose Taylor series coefficients are nonnegative. Our last result in this category works for unit-demand setting. It states that, for uniform distributions, the optimal menu contains at most 5 items. All these results are in sharp contrast to Hart and Nisan's recent result that finite-sized menu cannot guarantee any positive fraction of optimal revenue for correlated valuation distributions.\",\"PeriodicalId\":203155,\"journal\":{\"name\":\"Proceedings of the fifteenth ACM conference on Economics and computation\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"58\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the fifteenth ACM conference on Economics and computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2600057.2602863\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the fifteenth ACM conference on Economics and computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2600057.2602863","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 58

摘要

我们考虑一个买家和两种商品情况下的收益最优机制设计。买家对这两件物品的估价是独立的和附加的。在这种情况下,一般估值分布的最佳机制是未知的。我们得到了两类结构结果,阐明了最优机制。这些结果可以总结为一个结论:在一定条件下,最优机制具有简单的菜单。第一类结果表明,在一定条件下,最优机制具有单调菜单。换句话说,在代表最优机制的菜单中,随着支付的增加,两个项目的分配概率同时增加。这个定理补充了Hart和Reny最近关于菜单和收入在多项目设置下的非单调性的结果。应用这一定理,我们导出了收益单调性定理的一个版本,该定理表明随机的优分布产生更多的收益。此外,我们的定理包含了先前关于捆绑是最优的充分条件的结果[Hart and Nisan 2012]。第二类结果表明,在某些条件下,最优机制的菜单项很少。我们在这一类别中的第一个结果表明,对于某些发行版,最佳菜单最多包含4个项目。该条件允许幂(包括均匀)密度函数。我们在这个类别中的第二个结果适用于一个较弱(因此更普遍)的条件,在这个条件下,最佳菜单最多包含6个项目。这个条件足够普遍,足以包括各种密度函数,如指数函数和泰勒级数系数非负的任何函数。我们在这个类别中的最后一个结果适用于单位需求设置。它表明,对于均匀分布,最优菜单最多包含5个项目。所有这些结果都与哈特和尼桑最近的结果形成鲜明对比,即有限规模的菜单不能保证相关估值分布中最优收入的任何正部分。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal mechanisms with simple menus
We consider revenue-optimal mechanism design for the case with one buyer and two items. The buyer's valuations towards the two items are independent and additive. In this setting, optimal mechanism is unknown for general valuation distributions. We obtain two categories of structural results that shed light on the optimal mechanisms. These results can be summarized into one conclusion: under certain conditions, the optimal mechanisms have simple menus. The first category of results state that, under a centain condition, the optimal mechanism has a monotone menu. In other words, in the menu that represents the optimal mechanism, as payment increases, the allocation probabilities for both items increase simultaneously. This theorem complements Hart and Reny's recent result regarding the nonmonotonicity of menu and revenue in multi-item settings. Applying this theorem, we derive a version of revenue monotonicity theorem that states stochastically superior distributions yield more revenue. Moreover, our theorem subsumes a previous result regarding sufficient conditions under which bundling is optimal[Hart and Nisan 2012]. The second category of results state that, under certain conditions, the optimal mechanisms have few menu items. Our first result in this category says that, for certain distributions, the optimal menu contains at most 4 items. The condition admits power (including uniform) density functions. Our second result in this category works for a weaker (hence more general) condition, under which the optimal menu contains at most 6 items. This condition is general enough to include a wide variety of density functions, such as exponential functions and any function whose Taylor series coefficients are nonnegative. Our last result in this category works for unit-demand setting. It states that, for uniform distributions, the optimal menu contains at most 5 items. All these results are in sharp contrast to Hart and Nisan's recent result that finite-sized menu cannot guarantee any positive fraction of optimal revenue for correlated valuation distributions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信