论文标题
公平投资组合设计算法和学习
Algorithms and Learning for Fair Portfolio Design
论文作者
论文摘要
我们考虑了最佳投资组合设计的经典财务问题的变化。在我们的环境中,大量的消费者是从一定的分布中汲取了风险公差,并且必须将每个消费者分配给风险较低的投资组合。消费者也可能属于潜在的群体(例如,人口统计学或财富),目标是设计少数在特定自然技术意义上群体中公平的投资组合。 我们的主要结果是针对社会福利和公平目标的最佳和近乎最佳投资组合设计的算法,无论是在基础群体结构上还是没有假设。我们基于内部两人零和游戏来描述一种有效的算法,该游戏学习了近乎最佳的公平投资组合,并在实验上表明它也可以用于获得一小部分公平投资组合邮政。对于特殊但自然的案例,群体结构与风险公差相吻合(这模拟了富裕消费者通常容忍更大风险的现实),我们提供了一种有效且最佳的公平算法。我们还为基础风险分布提供了一般性保证,该风险分布不依赖投资组合的数量,并通过模拟结果说明了理论。
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.