arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2611.06097cs.GT
收藏

质量差异化市场中的双向筛选

Two-Sided Screening in Quality-Differentiated Markets

University of Electronic Science and Technology of China(电子科技大学);Central China Normal University(华中师范大学)

Yaohao Liu, Mengfan Ma, Mingyu Xiao

AI总结:

本文针对Uber、Airbnb等数字市场的双边平台,研究其质量菜单、价格与工资的设计问题,通过优化交易分布刻画最优菜单,证明利润最优菜单的效率,并开发多项式时间算法计算受限规模的近似最优菜单。

摘要:

受Uber和Airbnb等数字市场的启发,我们研究双边平台如何设计质量菜单、消费者价格以及提供者工资。消费者和提供者根据自身的私人价值和成本进行自我选择,因此平台必须设计其菜单以吸引消费者,同时诱导足够的供给来满足他们的需求。我们在连续质量空间上研究这一协调问题,要求供给在每个质量阈值处覆盖需求。我们将菜单设计表述为对交易分布的优化,交易分布指定了在每个质量水平或以上发生的交易量。通过对技术成本函数进行凸化处理,我们刻画了利润最优和社会福利最优的交易分布。这一刻画表明,仅生产技术就可以在不牺牲最优利润或社会福利的情况下减少菜单规模,且与类型分布的类型无关,同时确定了最优菜单何时可以是有限的。我们随后证明,利润最大化可以具有很高的效率:在双方都满足单调风险率条件的情况下,利润最优菜单至少能达到最优社会福利的1/(e-1)。接下来,我们考虑菜单规模被限制为规定数量的报价这一实际场景,建立了受限菜单在利润方面如何近似无约束最优解的方法,并开发了一种能在多项式时间内计算出符合该规模限制的菜单的算法,该算法计算出的菜单可同时以加性误差近似无约束最优利润和社会福利。

英文摘要:

Motivated by digital marketplaces such as Uber and Airbnb, we study how a two-sided platform designs a menu of qualities, consumer prices, and provider wages. Consumers and providers self-select according to their private values and costs, so the platform must design its menu to attract consumers while inducing enough supply to meet their demand. We study this coordination problem over a continuous quality space, requiring supply to cover demand at every quality threshold. We formulate menu design as an optimization over trading distributions, which specify how much trade occurs at or above each quality. Through convexification of the technological cost function, we characterize the profit- and welfare-optimal trading distributions. This characterization shows how production technology alone can reduce menu size without sacrificing optimal profit or welfare, regardless of the type distributions, and determines when optimal menus can be finite. We then show that profit maximization can be highly efficient: under monotone hazard rate conditions on both sides, a profit-optimal menu achieves at least $1/(e-1)$ of optimal social welfare. We next consider the practical setting in which the menu size is restricted to a prescribed number of offers. We establish how the restricted menu approximates the unrestricted optimum in profit. We develop an algorithm that computes a menu within this size limit in polynomial time. The computed menu simultaneously approximates the unrestricted optimal profit and social welfare with additive error.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑