首页> 外文会议>Annual Allerton Conference on Communication, Control, and Computing >A game theoretic approach to promotion design in two-sided platforms
【24h】

A game theoretic approach to promotion design in two-sided platforms

机译:双面平台上促销设计的博弈论方法

获取原文

摘要

Two-sided platforms often face a high degree of uncertainty in the availability of their service providers, which can harm the profit of the platform as it may result in too many or too few providers available for service. We propose a game-theoretic approach to optimal promotion design as a means by which platforms can influence providers' availability. We consider a mass of service providers in a two-sided market, each can be either active or not. The price paid for a service is decreasing with the number of active providers and increasing with a known demand. A provider participates only if his expected earning, that is the expected price less a fixed percentage held as the commission by the platform, passes his reserved price. There are two types of uncertainties in reserved prices. An idiosyncratic uncertainty which models the variation of reserved prices across providers; And a systematic uncertainty, representing the uncertainty in the overall average reserved price, which also accounts for the uncertainty in the number of active providers. We view the decision making of providers as a global game of strategic substitutes. Focusing on the threshold equilibria of the game, we formulate the optimal promotion design as an infinite dimensional convex optimization problem, where we show that the optimal decreasing promotion program is a combination of a bonus at all prices and a low-price-only bonus.
机译:双向平台通常在其服务提供商的可用性方面面临高度不确定性,这可能会损害平台的利润,因为这可能会导致可用于服务的提供商过多或过少。我们提出了一种基于博弈论的最佳促销设计方法,以此作为平台可以影响提供商可用性的一种手段。我们考虑了一个双向市场中的大量服务提供商,每个服务提供商都可以活跃或不活跃。服务的价格随着有效提供商的数量而下降,并且随着已知需求的增加而增加。提供者只有在其预期收入(即预期价格减去平台作为佣金收取的固定百分比)超过其保留价格时才参与。保留价格存在两种不确定性。一种特殊的不确定性,可以模拟不同提供商之间的保留价格变化;还有一个系统性的不确定性,代表整体平均保留价格的不确定性,这也说明了活跃提供者数量的不确定性。我们将提供商的决策视为全球战略替代产品的博弈。着眼于游戏的阈值均衡,我们将最优促销设计公式化为一个无穷维凸优化问题,我们证明了最优的递减促销计划是所有价格的奖励和仅低价的奖励的组合。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号