(1974)) and is used in the allocation of courses to university students though with more complex
utility functions and computations than our Fisher case (Budish et al
.
, 2013, 2016). Recent work
studies how general constraints can be added to CEEI allocations (Echenique et al
.
, 2021). Our
work adds to this literature by showing properties of specific constraints proposed in discussions
of demographic fairness in allocation. We do not seek to prove general results about all possible
constraint families. Instead, we focus on the more restrictive case of linear constraints in Fisher
markets which allows us to derive stronger results–i.e. the convex program to determine optimal
taxes/subsidies–than in general unit demand markets studied by Echenique et al. (2021).
Market equilibria in Fisher markets and their relationship to convex programming are well studied
(Eisenberg and Gale, 1959; Shmyrev, 2009; Cole et al
.
, 2017; Kroer et al
.
, 2019; Cole et al
.
, 2017;
Cole and Gkatzelis, 2018; Caragiannis et al
.
, 2016; Murray et al
.
, 2019; Gao and Kroer, 2020). Our
work complements this existing work as we show that the convex program equivalence allows us to
easily construct market interventions in the forms of taxes and subsidies. In addition, we use this
equivalence to construct a provably convergent online algorithm.
A recent literature has begun to study differential outcomes in online systems (Ali et al
.
, 2019;
Geyik et al
.
, 2019; Zhang, 2021; Imana et al
.
, 2021) across categories of users (e.g. job ads across
gender). Though a highly studied cause of these differential outcomes are biases in machine learning
systems, there are also market forces that can cause such issues. For example, Lambrecht and Tucker
(2018) studies STEM job ads competing in a real ad market and shows that “younger women are
a prized demographic and are more expensive to show ads to. An algorithm that simply optimizes
cost-effectiveness in ad delivery will deliver ads that were intended to be gender neutral in an
apparently discriminatory way, because of crowding out.” Our work further highlights the importance
of understanding market dynamics both in terms of how they cause disparate allocations as well as
how various interventions behave.
A recent literature has looked at implementing various notions of fairness in single auctions (Celis
et al
.
, 2019; Ilvento et al
.
, 2020; Chawla and Jagadeesan, 2022), paced auctions (Celli et al
.
, 2022) or
online allocation problems (Balseiro et al
.
, 2021b). Our work complements this by showing that in
markets similar implementation can be done via the use of the price system. In addition, these papers
study the performance of their algorithms but bypass the questions such as second order market
effects, who wins and who loses, and whether good incentive properties are preserved.
As discussed in Fazelpour et al
.
(2022), fairness constraints are often designed through desirable
properties of ideal states. However, when the current state is far from ideal, enforcing the constraints
may not bring us closer to the ideal state. Similar points has been made in the context of classification
(Corbett-Davies et al
.
, 2017; Menon and Williamson, 2018; Kasy and Abebe, 2021; Liu et al
.
, 2018;
Weber et al
.
, 2022), various ‘statistical discrimination’ scenarios (Fang and Moro, 2011; Mouzannar
et al
.
, 2019; Emelianov et al
.
, 2022), and counterfactual or causal definitions of fairness (Kusner et al
.
,
2017; Imai and Jiang, 2020; Nilforoshan et al
.
, 2022). Our results about parity and floor constraints
complement this literature showing that interventions in markets can sometimes (note, not always!)
make things worse than before. In the Appendix we provide a longer discussion of the various results
in this literature, which context they apply in, and how they relate to our results.
3 Fisher Markets
We will work with a market where there are
n
buyers (e.g. advertisers) and
m
items (e.g. ad
slots). Each item has supply
sj
which for the purposes of this section we take to be
1
. We assume
that fractional allocations are allowed (these can also be thought of as randomized allocations).
Fractional allocation ensures existence and polynomial time computability of equilibria. In practice
numerically that in many Fisher markets with linear utility, almost all assignments are
1
or
0
(Kroer
and Peysakhovich, 2019).
We let
x∈Rn×m
+
be an allocation of items to buyers. We let
xi∈Rm
+
be the bundle of goods
assigned to buyer
i
with
xij
being the assignment of item
j
. Each buyer has a utility function
vi(xi)
.
We assume the utilities are all homogeneous of degree one (i.e. that
αvi(xi) = vi(αxi)
for
α > 0
),
concave, and continuous. We also assume that there exists an allocation
x
such that
vi(xi)>0
for
all buyers i.
3