已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!祝你早点完成任务,早点休息,好梦!

Optimal Growth of a Two-Sided Platform with Heterogeneous Agents

计算机科学
作者
Zhu Yi-xin,Hongfan Chen,Renyu Zhang,Sean X. Zhou
出处
期刊:Social Science Research Network [Social Science Electronic Publishing]
标识
DOI:10.2139/ssrn.4734869
摘要

We consider the dynamics of a two-sided platform, where the agent population on both sides experiences growth over time with heterogeneous retention and new adoption. The compatibility between buyers and sellers is captured by a bipartite network. The platform strategically sets commissions to optimize its total profit over a horizon of T periods, considering the trade-off between short-term profit and growth as well as the spatial imbalances in supply and demand. We design an asymptotically optimal commission policy with the profit loss upper-bounded by a constant independent of T, in contrast with a myopic policy that is shown to be arbitrarily bad even if the platform is a monopoly intermediary in the market. To obtain this policy, we first develop a single-period benchmark problem that captures the optimal steady state of the platform, then delicately control the growth of the agent types with the lowest relative population level compared with the single-period benchmark in each period over time. We further examine the impact of the growth potential and the market network structure on agents' payment/income, and the platform's optimal commissions and optimal profit. To achieve that, we introduce innovative metrics to quantify the long-run growth potential of each agent type. Using these metrics, we first show that for each agent type, higher ratios of their compatible counterparts' long-term growth potential to their own cause lower payments (higher income) at the optimal steady state. In addition, the impact of the relative long-run growth potential on the platform's optimal commissions in a submarket depends on the convexity/concavity of the value distribution function of agents. Finally, we show that a ``balanced" network, where the relative long-run growth potential between sellers and buyers for all submarkets is the same as that for the entire market, allows the platform to achieve maximum profitability. The extent of network imbalance determines the lower bound for the achievable long-run average profit

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
缥缈的背包完成签到 ,获得积分10
刚刚
姜饼发布了新的文献求助10
1秒前
Mankind发布了新的文献求助10
3秒前
星辰完成签到 ,获得积分10
3秒前
4秒前
4秒前
儒雅香彤完成签到 ,获得积分10
8秒前
儒雅采文发布了新的文献求助10
9秒前
Tangtang发布了新的文献求助10
9秒前
10秒前
共享精神应助SG采纳,获得10
10秒前
JamesPei应助清秀的渊思采纳,获得10
11秒前
11秒前
LEO完成签到,获得积分10
12秒前
包容秋荷发布了新的文献求助10
14秒前
14秒前
coke发布了新的文献求助10
15秒前
Pupil发布了新的文献求助10
16秒前
16秒前
ttt关注了科研通微信公众号
21秒前
23秒前
23秒前
Once完成签到,获得积分10
24秒前
25秒前
李健应助独特的春采纳,获得10
26秒前
Once发布了新的文献求助10
28秒前
A晨发布了新的文献求助10
28秒前
无花果应助科研通管家采纳,获得10
29秒前
大模型应助科研通管家采纳,获得10
29秒前
深情安青应助科研通管家采纳,获得10
29秒前
打打应助科研通管家采纳,获得10
29秒前
29秒前
29秒前
慕青应助科研通管家采纳,获得10
29秒前
29秒前
29秒前
iman应助科研通管家采纳,获得10
29秒前
30秒前
31秒前
banbieshenlu发布了新的文献求助20
31秒前
高分求助中
The Mother of All Tableaux Order, Equivalence, and Geometry in the Large-scale Structure of Optimality Theory 2400
Ophthalmic Equipment Market by Devices(surgical: vitreorentinal,IOLs,OVDs,contact lens,RGP lens,backflush,diagnostic&monitoring:OCT,actorefractor,keratometer,tonometer,ophthalmoscpe,OVD), End User,Buying Criteria-Global Forecast to2029 2000
A new approach to the extrapolation of accelerated life test data 1000
Cognitive Neuroscience: The Biology of the Mind 1000
Cognitive Neuroscience: The Biology of the Mind (Sixth Edition) 1000
Optimal Transport: A Comprehensive Introduction to Modeling, Analysis, Simulation, Applications 800
Official Methods of Analysis of AOAC INTERNATIONAL 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3959821
求助须知:如何正确求助?哪些是违规求助? 3506056
关于积分的说明 11127696
捐赠科研通 3237994
什么是DOI,文献DOI怎么找? 1789429
邀请新用户注册赠送积分活动 871773
科研通“疑难数据库(出版商)”最低求助积分说明 803021