<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2 20190208//EN" "https://jats.nlm.nih.gov/publishing/1.2/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" article-type="review-article" dtd-version="1.2" xml:lang="en">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">IJECIS</journal-id>
<journal-title-group><journal-title>International Journal of E-Commerce and Information Systems</journal-title></journal-title-group>
<publisher><publisher-name>Thomson &amp; Ryberg Publications</publisher-name></publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.62715/ijecis.2026.v1.i1.pp8-14</article-id>
<article-id pub-id-type="publisher-id">631688451c</article-id>
<article-categories><subj-group subj-group-type="heading"><subject>Review Article</subject></subj-group></article-categories>
<title-group><article-title>Recommender System Fairness for Small Sellers on Multi-Sided Online Marketplaces</article-title></title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes"><name><surname>Balasubramanian</surname><given-names>Sona</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1">*</xref></contrib>
<contrib contrib-type="author"><name><surname>Park</surname><given-names>Kavita</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib>
<contrib contrib-type="author"><name><surname>Girard</surname><given-names>Shanice</given-names></name><xref ref-type="aff" rid="aff3"><sup>3</sup></xref></contrib>
<aff id="aff1"><label>1</label>Department of Computer Science, Ural Graduate Institute of Computer Science, Hungary</aff>
<aff id="aff2"><label>2</label>Department of Computer Science, Limpopo Center for Computer Science, Tanzania</aff>
<aff id="aff3"><label>3</label>Department of Computer Science, Mekong Institute for Advanced Computer Science, United Kingdom</aff>
</contrib-group>
<author-notes><corresp id="cor1">* Correspondence: <email>sona.balasubramanian@ural.edu</email></corresp></author-notes>
<pub-date pub-type="epub" iso-8601-date="2026-05-20"><day>20</day><month>05</month><year>2026</year></pub-date>
<volume>1</volume>
<issue>1</issue>
<fpage>8</fpage>
<lpage>14</lpage>
<history>
<date date-type="received" iso-8601-date="2026-02-05"><day>05</day><month>02</month><year>2026</year></date>
<date date-type="accepted" iso-8601-date="2026-04-03"><day>03</day><month>04</month><year>2026</year></date>
</history>
<permissions><copyright-statement>© 2026 The Author(s)</copyright-statement><copyright-year>2026</copyright-year><license license-type="open-access" xlink:href="https://creativecommons.org/licenses/by/4.0/"><license-p>This is an open access article distributed under the Creative Commons Attribution 4.0 International License (CC BY 4.0).</license-p></license></permissions>
<self-uri xlink:href="https://trpub.org/article.php?id=631688451c"/>
<abstract><p>Online marketplaces depend on recommender and ranking systems to decide which listings a shopper sees, and for a small seller that decision largely determines whether a sale is possible at all. Research on fairness in recommendation, which began with concern for the people receiving recommendations, has widened to include those being recommended. This narrative review examines that provider-side literature from the standpoint of small sellers on multi-sided marketplaces. It describes the mechanisms that concentrate exposure on established sellers, including popularity bias, position bias, cold start and feedback loops in training data. It then compares the main definitions of provider fairness, the algorithmic methods proposed to achieve them, and the evidence on trade-offs with consumer relevance and platform revenue. Problems of evaluation are discussed, as is the regulatory context in the European Union, where ranking transparency and self-preferencing are now subject to law. The review concludes that technical methods are mature relative to the understanding of what small sellers are owed, of how sellers respond strategically, and of long-run effects on the marketplace, and it identifies these as priorities for research.</p></abstract>
<kwd-group kwd-group-type="author">
<kwd>Recommender systems</kwd>
<kwd>Provider fairness</kwd>
<kwd>Fairness of exposure</kwd>
<kwd>Online marketplaces</kwd>
<kwd>Small sellers</kwd>
<kwd>Multi-sided platforms</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="sec1"><title>1. Introduction</title>
<p>A marketplace with millions of listings is usable only because software chooses a few dozen of them for each shopper. Search ranking, recommendation carousels, panels of related products and the default seller attached to a product page all perform this selection. For consumers the result is convenience. For sellers it is something closer to a licence to trade: a listing that is never shown cannot be bought, however good the product or the price. Because attention falls steeply with position, small differences in predicted relevance become large differences in sales.</p>
<p>Early work on algorithmic fairness in recommendation asked whether different groups of users received recommendations of equal quality. Burke (2017) pointed out that recommender systems serve several parties at once and distinguished fairness toward consumers, fairness toward providers, and the combination of the two. The idea was developed into a broader programme of multistakeholder recommendation (Abdollahpouri et al., 2020), and provider-side fairness is now a recognised topic in surveys of the field (Ekstrand et al., 2022).</p>
<p>This review reads that literature with one group of providers in mind: small sellers, meaning independent merchants with few listings, short sales histories and no bargaining power with the platform. Their position differs from that of the protected groups usually considered in fairness research, because smallness is an economic condition and not a legally protected attribute, and because the platform may itself compete with them. The review asks what is known about why small sellers receive little exposure, what fairness toward them could mean, which methods exist, and what remains unresolved.</p>
</sec>
<sec id="sec2"><title>2. Scope and Approach</title>
<p>The article is a narrative review of published work in recommender systems, information retrieval, and the economics and law of platforms. It concentrates on contributions that introduced a definition, a method or an empirical regularity on which later work has built, and it does not attempt a complete census of a literature that is growing quickly. Material on ranking is included alongside recommendation, since on a marketplace the two are implemented by similar learning-to-rank models and raise the same questions of exposure. Fairness toward consumers, and fairness across demographic groups of providers, are discussed only where they bear on sellers of different size.</p>
</sec>
<sec id="sec3"><title>3. Why Small Sellers Receive Little Exposure</title>
<p>Four mechanisms, each well documented, work against the small seller. The first is popularity bias. Collaborative filtering learns from past interactions, and items with many interactions are both better modelled and more often recommended, so that recommendation lists over-represent what is already popular (Abdollahpouri et al., 2017). The second is the cold-start problem: a new listing or a new seller has no interaction history from which to infer relevance (Schein et al., 2002). Small sellers are disproportionately new, and their listings spend more of their lives in this state.</p>
<p>The third mechanism is position bias. Users examine results roughly from the top down and often stop early, so a click is evidence of position as well as of relevance (Craswell et al., 2008). A model trained on raw clicks therefore learns that items shown high were good, whether or not they were. The fourth mechanism joins the others into a loop, shown in Figure 1. The system&#x27;s own output determines what users can interact with, those interactions become the next round of training data, and the model&#x27;s earlier choices are confirmed. Simulation work has shown that such algorithmic confounding homogenises user behaviour without improving utility (Chaney et al., 2018).</p>
<fig id="fig1"><label>Figure 1</label><caption><p>The feedback loop through which a ranking model trained on its own logged output concentrates exposure on established sellers</p></caption><graphic xlink:href="IJECIS_V1I1_2026_02_Figure1.png" mimetype="image" mime-subtype="png"/></fig>
<p>The economic literature gives a mixed picture of the aggregate result. Online retail made a far wider range of products available than physical shops could stock, and consumers gained substantially from that variety (Brynjolfsson et al., 2003), an observation often discussed under the name of the long tail. Yet availability is not exposure. Fleder and Hosanagar (2009) showed analytically and by simulation that common recommender designs can reduce the diversity of sales in aggregate even while individual users are led to items new to them, because the system steers many users toward the same items. For a small seller the practical meaning is that being listed in the tail does not ensure being found.</p>
</sec>
<sec id="sec4"><title>4. What Fairness Toward Sellers Could Mean</title>
<p>Definitions of provider fairness differ in what is to be equalised, among whom, and over what period. Table 1 summarises the principal notions. Most treat exposure, meaning the attention a ranking position is expected to receive, as the resource being distributed.</p>
<table-wrap id="tbl1"><label>Table 1</label><caption><p>Principal notions of provider-side fairness in ranking and recommendation, and the difficulty each meets when applied to small sellers</p></caption><table frame="hsides" rules="groups"><thead><tr><th>Notion</th><th>Requirement</th><th>Source</th><th>Difficulty for small sellers</th></tr></thead><tbody><tr><td>Equal exposure across groups</td><td>Groups of providers receive the same average exposure</td><td>Singh and Joachims, 2018</td><td>Disregards differences in relevance and quality</td></tr><tr><td>Exposure proportional to merit</td><td>Exposure of each group tracks its relevance to users</td><td>Singh and Joachims, 2018</td><td>Merit estimates are biased by past exposure</td></tr><tr><td>Equity of attention</td><td>Attention proportional to relevance, accumulated over many rankings</td><td>Biega et al., 2018</td><td>New sellers appear in too few rankings to accumulate</td></tr><tr><td>Minimum share in the top-k</td><td>Every prefix of the list holds a minimum share of a group</td><td>Zehlike et al., 2017</td><td>Needs a group boundary and a chosen quota</td></tr><tr><td>Guaranteed minimum exposure</td><td>Each provider receives at least a floor of exposure</td><td>Patro et al., 2020</td><td>A floor may be too low to yield sales</td></tr><tr><td>Individual fairness</td><td>Similar providers are treated similarly</td><td>Dwork et al., 2012</td><td>Rests on a contested measure of similarity</td></tr></tbody></table></table-wrap>
<p>Singh and Joachims (2018) gave the formulation that most later work adopts. They represented a ranking policy as a probability distribution over rankings, defined exposure through a position-discount model, and expressed fairness as linear constraints, which lets the platform maximise expected utility to users subject to a chosen exposure rule. Their constraints include equal exposure across groups and exposure in proportion to the groups&#x27; relevance. Biega et al. (2018) argued that fairness within a single ranking is unattainable when several items are nearly equally relevant, since only one can be first, and proposed that attention be made proportional to relevance cumulatively over a sequence of rankings.</p>
<p>Other definitions set floors instead of proportions. The FA*IR algorithm guarantees that the share of a protected group in every prefix of a top-k list does not fall significantly below a target (Zehlike et al., 2017). FairRec, designed for two-sided platforms, guarantees each producer a minimum level of exposure while keeping the allocation nearly envy-free among customers (Patro et al., 2020). Underlying all of these is the older distinction between group fairness and individual fairness, the latter requiring that similar individuals be treated similarly (Dwork et al., 2012). A survey by Zehlike et al. (2022) classifies ranking methods by the normative position each embodies.</p>
<p>Applied to small sellers, each definition meets a difficulty of its own. Proportional rules depend on a measure of merit, and predicted relevance is contaminated by the exposure history it is meant to correct. Group rules need a boundary, and any threshold of size invites sellers to arrange themselves on its favourable side. Floors can be met with exposure in placements that seldom convert. And none of the definitions says why size should matter. Possible grounds include equal opportunity to compete, the long-run value of a diverse seller base to consumers, and the dependence of sellers on a platform they cannot readily leave. These are different reasons and they support different rules.</p>
</sec>
<sec id="sec5"><title>5. Methods for Allocating Exposure</title>
<p>Methods are usually grouped by where they act. Pre-processing approaches correct the training data. Inverse propensity weighting treats the logging policy as an intervention and reweights observed interactions by the probability that they could have been observed, which removes selection bias from ratings (Schnabel et al., 2016) and position bias from clicks (Joachims et al., 2017). These techniques were developed for accuracy, not fairness, but they address the contamination of merit estimates directly and are arguably the first step that any seller-fair system should take.</p>
<p>In-processing approaches change the learning objective. A regularisation term can penalise lists drawn only from popular items (Abdollahpouri et al., 2017), and provider constraints can be built into the optimisation that generates recommendations (Sürer et al., 2018). Post-processing approaches leave the model alone and re-rank its output, which is how FA*IR and FairRec operate and why they are attractive to platforms that are reluctant to retrain production models. Dynamic methods go further and treat fairness as a control problem: the FairCo controller adjusts rankings over time so that amortised exposure converges to the target while relevance estimates are debiased as data arrive (Morik et al., 2020).</p>
<p>Exploration deserves separate mention because it speaks to the cold-start condition in which small sellers so often find themselves. A system that occasionally shows uncertain items learns their true appeal and gives new listings a chance to earn a history. From the seller&#x27;s side, a guaranteed period of exploratory exposure may matter more than any steady-state fairness constraint, since it determines whether a listing ever leaves the cold-start state. The fairness literature and the literature on exploration in recommendation have developed largely apart, and the connection between them is under-studied.</p>
</sec>
<sec id="sec6"><title>6. Trade-offs With Consumers and the Platform</title>
<p>Any reallocation of exposure away from the items a model ranks highest has a cost in predicted relevance, and the size of that cost is the central empirical question. Mehrotra et al. (2018), working with data from a music streaming service, used counterfactual estimation to study the trade-off between relevance, supplier fairness and user satisfaction, and considered policies that adapt the weight placed on fairness to each user&#x27;s tolerance for less familiar suppliers. The general lesson is that the trade-off is not a fixed exchange rate. It depends on how many alternatives of nearly equal relevance exist, and in broad product categories there are often many.</p>
<p>The platform&#x27;s own interest is harder to read from outside. In the theory of two-sided markets a platform gains from participation on both sides and sets its terms to balance them (Rochet and Tirole, 2003), and a marketplace in the sense of Hagiu and Wright (2015) leaves control of the sale to independent sellers. That gives the platform a reason to keep small sellers viable. It also earns commission and advertising revenue that rise with the sales of large sellers, and it may sell its own products alongside theirs. Whether seller fairness aligns with platform profit is therefore an empirical matter that varies by platform, and published evidence from marketplaces themselves is scarce.</p>
</sec>
<sec id="sec7"><title>7. Problems of Evaluation</title>
<p>Evaluating provider fairness is more difficult than defining it. Offline metrics computed on logged data inherit the biases of the logging policy, so an exposure measure may look fair on historical data and behave differently once deployed. Exposure itself is modelled, typically with a logarithmic or geometric discount by position, and real attention on a mobile grid or a carousel may not follow the assumed curve. Online experiments face a further obstacle: sellers compete for the same finite attention, so treating some sellers changes outcomes for the rest, and the usual assumption that experimental units do not interfere with one another fails.</p>
<p>There is also the question of what to measure. Exposure is an input. Sellers care about sales, revenue and survival, and the mapping from exposure to those outcomes differs with price, reviews and fulfilment. A small seller given more impressions but lacking the reviews that reassure buyers may convert few of them, and a system judged fair by exposure may leave outcomes unchanged. Long-run measures, such as the rate at which new sellers reach a sustainable volume or the concentration of sales over time, would be more informative and are seldom reported.</p>
</sec>
<sec id="sec8"><title>8. Regulation and Self-Preferencing</title>
<p>Law has begun to address ranking on platforms, at least in the European Union. Regulation (EU) 2019/1150 obliges online intermediation services to set out in their terms the main parameters determining ranking and the reasons for their relative importance, and to describe any differentiated treatment they give to their own goods (European Union, 2019). The Digital Markets Act goes beyond transparency: designated gatekeepers may not rank their own products and services more favourably than those of third parties and must apply transparent, fair and non-discriminatory conditions to ranking (European Union, 2022). The concern behind these provisions, that a platform acting as both marketplace and merchant has the means and motive to disadvantage dependent sellers, was set out influentially by Khan (2017).</p>
<p>These rules concern the platform&#x27;s treatment of rivals and the disclosure of ranking criteria. They do not require any particular distribution of exposure among third-party sellers, and a ranking that is transparent and free of self-preferencing can still concentrate attention on a few large merchants through the mechanisms described earlier. The technical literature and the legal one thus address adjacent problems. A useful bridge would be auditing methods that let a regulator or a seller association test a disclosed ranking rule against observed exposure.</p>
</sec>
<sec id="sec9"><title>9. Gaps and Future Work</title>
<p>Three gaps stand out. One is normative. The field has many formal definitions and little argument about which of them a small seller has a claim to, or on what ground. Work that connects exposure rules to explicit principles, such as opportunity for new entrants or protection of dependent trading partners, would make the choice among definitions less arbitrary. A second gap is strategic behaviour. Sellers are not passive items. They respond to ranking rules by splitting or merging accounts, duplicating listings, buying advertising and adjusting prices, and a fairness rule keyed to size or novelty creates incentives of its own. Mechanism-design analysis of fairness interventions is at an early stage.</p>
<p>The third gap is evidence from the field. Many published evaluations use public datasets from domains such as film, music or hiring, where providers are not merchants and the unit economics of a sale are absent. Studies on marketplace data, with outcomes measured in seller revenue and survival, are needed, as are studies of sponsored listings, which occupy many of the most visible positions and sit outside most fairness formulations. Small sellers who cannot afford to advertise may be affected more by the growth of paid placement than by any property of the organic ranking model.</p>
</sec>
<sec id="sec10"><title>10. Conclusion</title>
<p>Research on recommender fairness now recognises sellers as parties with a stake in the ranking. The mechanisms that concentrate exposure, namely popularity bias, cold start, position bias and feedback through training data, are well understood, and a range of methods can redistribute exposure at a cost in relevance that depends on how many close substitutes exist. What the literature does not yet supply is a settled account of what small sellers are owed, evidence on how sellers and platforms behave once a rule is in place, or measurement of the outcomes that matter to a merchant.</p>
<p>Progress will depend less on new re-ranking algorithms than on connecting three bodies of work that have grown separately: the technical study of exposure, the economics of multi-sided platforms, and the law on ranking transparency and self-preferencing. Marketplaces that open data and experiments to researchers, under suitable safeguards, would allow that connection to be made on evidence.</p>
</sec>
<sec id="sec11"><title>Conflict of interest</title>
<p>To be declared by the author(s) before publication.</p>
</sec>
<sec id="sec12"><title>Funding</title>
<p>To be declared by the author(s) before publication.</p>
</sec>
</body>
<back>
<ref-list><title>References</title>
<ref id="ref1"><label>1</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Abdollahpouri, H., Adomavicius, G., Burke, R., Guy, I., Jannach, D., Kamishima, T., Krasnodebski, J. and Pizzato, L.</string-name></person-group> (<year>2020</year>). <article-title>Multistakeholder recommendation: Survey and research directions</article-title>. <source>User Modeling and User-Adapted Interaction</source>, <volume>30(1)</volume>, <fpage>127-158</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s11257-019-09256-1">https://doi.org/10.1007/s11257-019-09256-1</ext-link></mixed-citation></ref>
<ref id="ref2"><label>2</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Abdollahpouri, H., Burke, R. and Mobasher, B.</string-name></person-group> (<year>2017</year>). <article-title>Controlling popularity bias in learning-to-rank recommendation</article-title>. <source>Proceedings of the Eleventh ACM Conference on Recommender Systems</source>, <fpage>42-46</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/3109859.3109912">https://doi.org/10.1145/3109859.3109912</ext-link></mixed-citation></ref>
<ref id="ref3"><label>3</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Biega, A.J., Gummadi, K.P. and Weikum, G.</string-name></person-group> (<year>2018</year>). <article-title>Equity of attention: Amortizing individual fairness in rankings</article-title>. <source>Proceedings of the 41st International ACM SIGIR Conference on Research and Development in Information Retrieval</source>, <fpage>405-414</fpage></mixed-citation></ref>
<ref id="ref4"><label>4</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Brynjolfsson, E., Hu, Y. and Smith, M.D.</string-name></person-group> (<year>2003</year>). <article-title>Consumer surplus in the digital economy: Estimating the value of increased product variety at online booksellers</article-title>. <source>Management Science</source>, <volume>49(11)</volume>, <fpage>1580-1596</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1287/mnsc.49.11.1580.20580">https://doi.org/10.1287/mnsc.49.11.1580.20580</ext-link></mixed-citation></ref>
<ref id="ref5"><label>5</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Burke, R.</string-name></person-group> (<year>2017</year>). <article-title>Multisided fairness for recommendation</article-title>. <source>arXiv preprint, arXiv:1707.00093</source></mixed-citation></ref>
<ref id="ref6"><label>6</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Chaney, A.J.B., Stewart, B.M. and Engelhardt, B.E.</string-name></person-group> (<year>2018</year>). <article-title>How algorithmic confounding in recommendation systems increases homogeneity and decreases utility</article-title>. <source>Proceedings of the 12th ACM Conference on Recommender Systems</source>, <fpage>224-232</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/3240323.3240370">https://doi.org/10.1145/3240323.3240370</ext-link></mixed-citation></ref>
<ref id="ref7"><label>7</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Craswell, N., Zoeter, O., Taylor, M. and Ramsey, B.</string-name></person-group> (<year>2008</year>). <article-title>An experimental comparison of click position-bias models</article-title>. <source>Proceedings of the 2008 International Conference on Web Search and Data Mining</source>, <fpage>87-94</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/1341531.1341545">https://doi.org/10.1145/1341531.1341545</ext-link></mixed-citation></ref>
<ref id="ref8"><label>8</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Dwork, C., Hardt, M., Pitassi, T., Reingold, O. and Zemel, R.</string-name></person-group> (<year>2012</year>). <article-title>Fairness through awareness</article-title>. <source>Proceedings of the 3rd Innovations in Theoretical Computer Science Conference</source>, <fpage>214-226</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/2090236.2090255">https://doi.org/10.1145/2090236.2090255</ext-link></mixed-citation></ref>
<ref id="ref9"><label>9</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Ekstrand, M.D., Das, A., Burke, R. and Diaz, F.</string-name></person-group> (<year>2022</year>). <article-title>Fairness in information access systems</article-title>. <source>Foundations and Trends in Information Retrieval</source>, <volume>16(1-2)</volume>, <fpage>1-177</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1561/1500000079">https://doi.org/10.1561/1500000079</ext-link></mixed-citation></ref>
<ref id="ref10"><label>10</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>European Union</string-name></person-group> (<year>2019</year>). <article-title>Regulation (EU) 2019/1150 of the European Parliament and of the Council of 20 June 2019 on promoting fairness and transparency for business users of online intermediation services</article-title>. <source>Official Journal of the European Union, L 186: 57-79</source></mixed-citation></ref>
<ref id="ref11"><label>11</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>European Union</string-name></person-group> (<year>2022</year>). <article-title>Regulation (EU) 2022/1925 of the European Parliament and of the Council of 14 September 2022 on contestable and fair markets in the digital sector (Digital Markets Act)</article-title>. <source>Official Journal of the European Union, L 265: 1-66</source></mixed-citation></ref>
<ref id="ref12"><label>12</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Fleder, D. and Hosanagar, K.</string-name></person-group> (<year>2009</year>). <article-title>Blockbuster culture&#x27;s next rise or fall: The impact of recommender systems on sales diversity</article-title>. <source>Management Science</source>, <volume>55(5)</volume>, <fpage>697-712</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1287/mnsc.1080.0974">https://doi.org/10.1287/mnsc.1080.0974</ext-link></mixed-citation></ref>
<ref id="ref13"><label>13</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Hagiu, A. and Wright, J.</string-name></person-group> (<year>2015</year>). <article-title>Multi-sided platforms</article-title>. <source>International Journal of Industrial Organization</source>, <volume>43</volume>, <fpage>162-174</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ijindorg.2015.03.003">https://doi.org/10.1016/j.ijindorg.2015.03.003</ext-link></mixed-citation></ref>
<ref id="ref14"><label>14</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Joachims, T., Swaminathan, A. and Schnabel, T.</string-name></person-group> (<year>2017</year>). <article-title>Unbiased learning-to-rank with biased feedback</article-title>. <source>Proceedings of the Tenth ACM International Conference on Web Search and Data Mining</source>, <fpage>781-789</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/3018661.3018699">https://doi.org/10.1145/3018661.3018699</ext-link></mixed-citation></ref>
<ref id="ref15"><label>15</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Khan, L.M.</string-name></person-group> (<year>2017</year>). <article-title>Amazon&#x27;s antitrust paradox</article-title>. <source>Yale Law Journal</source>, <volume>126(3)</volume>, <fpage>710-805</fpage></mixed-citation></ref>
<ref id="ref16"><label>16</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Mehrotra, R., McInerney, J., Bouchard, H., Lalmas, M. and Diaz, F.</string-name></person-group> (<year>2018</year>). <article-title>Towards a fair marketplace: Counterfactual evaluation of the trade-off between relevance, fairness &amp; satisfaction in recommendation systems</article-title>. <source>Proceedings of the 27th ACM International Conference on Information and Knowledge Management</source>, <fpage>2243-2251</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/3269206.3272027">https://doi.org/10.1145/3269206.3272027</ext-link></mixed-citation></ref>
<ref id="ref17"><label>17</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Morik, M., Singh, A., Hong, J. and Joachims, T.</string-name></person-group> (<year>2020</year>). <article-title>Controlling fairness and bias in dynamic learning-to-rank</article-title>. <source>Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval</source>, <fpage>429-438</fpage></mixed-citation></ref>
<ref id="ref18"><label>18</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Patro, G.K., Biswas, A., Ganguly, N., Gummadi, K.P. and Chakraborty, A.</string-name></person-group> (<year>2020</year>). <article-title>FairRec: Two-sided fairness for personalized recommendations in two-sided platforms</article-title>. <source>Proceedings of The Web Conference 2020</source>, <fpage>1194-1204</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/3366423.3380196">https://doi.org/10.1145/3366423.3380196</ext-link></mixed-citation></ref>
<ref id="ref19"><label>19</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Rochet, J.-C. and Tirole, J.</string-name></person-group> (<year>2003</year>). <article-title>Platform competition in two-sided markets</article-title>. <source>Journal of the European Economic Association</source>, <volume>1(4)</volume>, <fpage>990-1029</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1162/154247603322493212">https://doi.org/10.1162/154247603322493212</ext-link></mixed-citation></ref>
<ref id="ref20"><label>20</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Schein, A.I., Popescul, A., Ungar, L.H. and Pennock, D.M.</string-name></person-group> (<year>2002</year>). <article-title>Methods and metrics for cold-start recommendations</article-title>. <source>Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</source>, <fpage>253-260</fpage></mixed-citation></ref>
<ref id="ref21"><label>21</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Schnabel, T., Swaminathan, A., Singh, A., Chandak, N. and Joachims, T.</string-name></person-group> (<year>2016</year>). <article-title>Recommendations as treatments: Debiasing learning and evaluation</article-title>. <source>Proceedings of the 33rd International Conference on Machine Learning, PMLR 48: 1670-1679</source></mixed-citation></ref>
<ref id="ref22"><label>22</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Singh, A. and Joachims, T.</string-name></person-group> (<year>2018</year>). <article-title>Fairness of exposure in rankings</article-title>. <source>Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining</source>, <fpage>2219-2228</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/3219819.3220088">https://doi.org/10.1145/3219819.3220088</ext-link></mixed-citation></ref>
<ref id="ref23"><label>23</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Sürer, Ö., Burke, R. and Malthouse, E.C.</string-name></person-group> (<year>2018</year>). <article-title>Multistakeholder recommendation with provider constraints</article-title>. <source>Proceedings of the 12th ACM Conference on Recommender Systems</source>, <fpage>54-62</fpage></mixed-citation></ref>
<ref id="ref24"><label>24</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Zehlike, M., Bonchi, F., Castillo, C., Hajian, S., Megahed, M. and Baeza-Yates, R.</string-name></person-group> (<year>2017</year>). <article-title>FA*IR: A fair top-k ranking algorithm</article-title>. <source>Proceedings of the 2017 ACM Conference on Information and Knowledge Management</source>, <fpage>1569-1578</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/3132847.3132938">https://doi.org/10.1145/3132847.3132938</ext-link></mixed-citation></ref>
<ref id="ref25"><label>25</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Zehlike, M., Yang, K. and Stoyanovich, J.</string-name></person-group> (<year>2022</year>). <article-title>Fairness in ranking, Part I: Score-based ranking</article-title>. <source>ACM Computing Surveys, 55(6): Article 118</source> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/3533379">https://doi.org/10.1145/3533379</ext-link></mixed-citation></ref>
</ref-list>
</back>
</article>