arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.07281cs.LGcs.CEcs.GTstat.ML
收藏

公平投资组合设计的算法与学习

Algorithms and Learning for Fair Portfolio Design

University of Pennsylvania(宾夕法尼亚大学)

Emily Diana, Travis Dick, Hadi Elzayn, Michael Kearns, Aaron Roth, Zachary Schutzman, Saeed Sharifi-Malvajerdi, Juba Ziani

摘要:

我们考虑一个经典金融问题的最优投资组合设计的变化。在我们的设置中,大量的消费者是从风险承受能力的分布中抽取的,每个消费者都必须被分配到一个风险低于其承受能力的投资组合中。消费者也可能属于潜在的群体(例如,人口统计属性或财富),目标是设计少量的投资组合,这些投资组合在特定和自然的技术意义上在群体之间是公平的。我们的主要结果是算法的最优和接近最优的投资组合设计的社会福利和公平的目标,无论是有和没有假设的基本群体结构。我们描述了一个有效的算法的基础上,内部两个玩家零和游戏,学习近最佳的公平投资组合事前,并通过实验表明,它可以用来获得一个小的公平投资组合事后以及。对于特殊但自然的情况下,组结构与风险容忍度(模型的现实,富有的消费者通常容忍更大的风险)相一致,我们给出了一个有效的和最优的公平算法。我们还提供了泛化保证的基础风险分布,没有依赖于投资组合的数量,并说明了理论与模拟结果。

英文摘要:

We consider a variation on the classical finance problem of optimal portfolio design. In our setting, a large population of consumers is drawn from some distribution over risk tolerances, and each consumer must be assigned to a portfolio of lower risk than her tolerance. The consumers may also belong to underlying groups (for instance, of demographic properties or wealth), and the goal is to design a small number of portfolios that are fair across groups in a particular and natural technical sense. Our main results are algorithms for optimal and near-optimal portfolio design for both social welfare and fairness objectives, both with and without assumptions on the underlying group structure. We describe an efficient algorithm based on an internal two-player zero-sum game that learns near-optimal fair portfolios ex ante and show experimentally that it can be used to obtain a small set of fair portfolios ex post as well. For the special but natural case in which group structure coincides with risk tolerances (which models the reality that wealthy consumers generally tolerate greater risk), we give an efficient and optimal fair algorithm. We also provide generalization guarantees for the underlying risk distribution that has no dependence on the number of portfolios and illustrate the theory with simulation results.

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

↑