Fairness Incentives for Myopic Agents

Sampath Kannan, Michael Kearns, Jamie Morgenstern, Mallesh M. Pai, Aaron Roth, R. Vohra, Zhiwei Steven Wu
{"title":"Fairness Incentives for Myopic Agents","authors":"Sampath Kannan, Michael Kearns, Jamie Morgenstern, Mallesh M. Pai, Aaron Roth, R. Vohra, Zhiwei Steven Wu","doi":"10.1145/3033274.3085154","DOIUrl":null,"url":null,"abstract":"We consider settings in which we wish to incentivize myopic agents (such as Airbnb landlords, who may emphasize short-term profits and property safety) to treat arriving clients fairly, in order to prevent overall discrimination against individuals or groups. We model such settings in both classical and contextual bandit models in which the myopic agents maximize rewards according to current empirical averages, but are also amenable to exogenous payments that may cause them to alter their choices. Our notion of fairness asks that more qualified individuals are never (probabilistically) preferred over less qualifie ones [8]. We investigate whether it is possible to design inexpensive subsidy or payment schemes for a principal to motivate myopic agents to play fairly in all or almost all rounds. When the principal has full information about the state of the myopic agents, we show it is possible to induce fair play on every round with a subsidy scheme of total cost o(T) (for the classic setting with k arms, ~{O}(\\sqrtk3T), and for the d-dimensional linear contextual setting ~{O}(d\\sqrtk3T)). If the principal has much more limited information (as might often be the case for an external regulator or watchdog), and only observes the number of rounds in which members from each of the k groups were selected, but not the empirical estimates maintained by the myopic agent, the design of such a scheme becomes more complex. We show both positive and negative results in the classic and linear bandit settings by upper and lower bounding the cost of fair subsidy schemes.","PeriodicalId":287551,"journal":{"name":"Proceedings of the 2017 ACM Conference on Economics and Computation","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"42","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2017 ACM Conference on Economics and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3033274.3085154","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 42

Abstract

We consider settings in which we wish to incentivize myopic agents (such as Airbnb landlords, who may emphasize short-term profits and property safety) to treat arriving clients fairly, in order to prevent overall discrimination against individuals or groups. We model such settings in both classical and contextual bandit models in which the myopic agents maximize rewards according to current empirical averages, but are also amenable to exogenous payments that may cause them to alter their choices. Our notion of fairness asks that more qualified individuals are never (probabilistically) preferred over less qualifie ones [8]. We investigate whether it is possible to design inexpensive subsidy or payment schemes for a principal to motivate myopic agents to play fairly in all or almost all rounds. When the principal has full information about the state of the myopic agents, we show it is possible to induce fair play on every round with a subsidy scheme of total cost o(T) (for the classic setting with k arms, ~{O}(\sqrtk3T), and for the d-dimensional linear contextual setting ~{O}(d\sqrtk3T)). If the principal has much more limited information (as might often be the case for an external regulator or watchdog), and only observes the number of rounds in which members from each of the k groups were selected, but not the empirical estimates maintained by the myopic agent, the design of such a scheme becomes more complex. We show both positive and negative results in the classic and linear bandit settings by upper and lower bounding the cost of fair subsidy schemes.
近视代理人的公平激励
我们考虑了一些我们希望激励短视代理(如Airbnb房东,他们可能强调短期利润和财产安全)公平对待到达客户的设置,以防止对个人或群体的整体歧视。我们在经典和情境强盗模型中建立了这样的模型,在这些模型中,近视代理根据当前的经验平均值最大化奖励,但也服从可能导致他们改变选择的外生支付。我们对公平的看法是,更合格的人永远不会(概率上)比不合格的人更受青睐。我们调查是否有可能为委托人设计廉价的补贴或支付方案,以激励近视代理人在所有或几乎所有回合中公平竞争。当委托人有关于近视代理状态的充分信息时,我们证明了用总成本为o(T)的补贴方案(对于具有k臂的经典设置,~{o}(\sqrtk3T)和d维线性情境设置~{o}(d\sqrtk3T))在每一轮中诱导公平竞争是可能的。如果委托人的信息有限得多(外部监管机构或监督机构可能经常是这种情况),并且只观察k组中每组成员被选中的轮数,而不是短视的代理人所维持的经验估计,那么这种方案的设计就会变得更加复杂。我们通过公平补贴计划的成本上限和下限,在经典和线性强盗设置中显示了积极和消极的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信