Fairness Incentives for Myopic Agents
Not on the map. Why?
Abstract (arXiv)
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 qualified ones [Joseph et al]. 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, tildeO(√k3T), and for the d-dimensional linear contextual setting tildeO(d√k3 T)). 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.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 May 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 1; 2023: 2; 2024: 1; 2025: 1; 2026: 1.
10 papers.
- 2021Fair Exploration via Axiomatic Bargainingcited by 21
- 2021Incentivizing Exploration in Linear Bandits under Information Gapcited by 5
- 2022Incentive-Aware Recommender Systems in Two-Sided Marketscited by 5
- 2023Incentivizing Exploration with Linear Contexts and Combinatorial Actionscited by 5
- 2021Incentivizing Compliance with Algorithmic Instrumentscited by 4
- 2023When Are Two Lists Better than One?: Benefits and Harms in Joint Decision-makingcited by 4
- 2024Tractable Equilibrium Computation in Markov Games through Risk Aversioncited by 3
- 2021Socially-Optimal Mechanism Design for Incentivized Online Learningcited by 2
- 2026Multi-Round Human-AI Collaboration with User-Specified Requirementscited by 2
- 2025Geometry Meets Incentives: Sample-Efficient Incentivized Exploration with Linear Contextscited by 0
- 2026Multi-Round Human-AI Collaboration with User-Specified Requirements19 Feb 2026
- 2025Geometry Meets Incentives: Sample-Efficient Incentivized Exploration with Linear Contexts2 Jun 2025
- 2024Tractable Equilibrium Computation in Markov Games through Risk Aversion20 Jun 2024
- 2023When Are Two Lists Better than One?: Benefits and Harms in Joint Decision-making22 Aug 2023
- 2023Incentivizing Exploration with Linear Contexts and Combinatorial Actions3 Jun 2023
- 2022Incentive-Aware Recommender Systems in Two-Sided Markets23 Nov 2022
- 2021Socially-Optimal Mechanism Design for Incentivized Online Learning29 Dec 2021
- 2021Incentivizing Compliance with Algorithmic Instruments21 Jul 2021
- 2021Fair Exploration via Axiomatic Bargaining4 Jun 2021
- 2021Incentivizing Exploration in Linear Bandits under Information Gap8 Apr 2021