<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Algorithmic Collective Action in Recommender Systems: Promoting Songs by Reordering Playlists</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Joachim</forename><surname>Baumann</surname></persName>
							<email>baumann@ifi.uzh.ch</email>
							<affiliation key="aff0">
								<orgName type="institution" key="instit1">University of Zurich</orgName>
								<orgName type="institution" key="instit2">Zurich University of Applied Sciences</orgName>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Celestine</forename><surname>Mendler-Dünner</surname></persName>
							<email>celestine@tue.ellis.eu</email>
							<affiliation key="aff1">
								<orgName type="department">Max Planck Institute for Intelligent Systems</orgName>
								<orgName type="institution">ELLIS Institute</orgName>
								<address>
									<settlement>Tübingen</settlement>
								</address>
							</affiliation>
							<affiliation key="aff2">
								<orgName type="institution">Tübingen and Tübingen AI Center</orgName>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff3">
								<orgName type="department">Max-Planck Institute for Intelligent Systems</orgName>
								<address>
									<settlement>Tübingen</settlement>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Algorithmic Collective Action in Recommender Systems: Promoting Songs by Reordering Playlists</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">569548D90CAAD8978FAD3C7194E10946</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T16:31+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>music recommendation</term>
					<term>collective action</term>
					<term>power dynamics</term>
					<term>transformer models</term>
					<term>participatory AI</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>We investigate algorithmic collective action in transformer-based recommender systems. Our use case is a collective of fans aiming to promote the visibility of an artist by strategically placing one of their songs in the existing playlists they control. The success of the collective is measured by the increase in test-time recommendations of the targeted song. We introduce an easily implementable strategy towards this goal and test its efficacy on a publicly available recommender system model used in production by a major music streaming platform. Our findings reveal that even small collectives (controlling less than 0.01% of the training data) can achieve up to 25× amplification of recommendations by strategically choosing the position at which to insert the song. Further, we find that the strategy only minimally impairs user experience; recommendations of other songs are largely preserved, and newly gained recommendations are taken from diverse songs of varying popularity levels. Taken together, our findings demonstrate how algorithmic collective action can be effective while not necessarily being adversarial, raising new questions around fairness, incentives, and social dynamics in recommender systems.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>In the ever-evolving landscape of music discovery, the challenge of sifting through the overwhelming number of tracks released daily has become increasingly difficult for both platforms and streamers. This has resulted in a strong dependence on platforms like Spotify, Deezer, or Apple Music, which distribute and promote music through song recommendations. These systems rely on historical data to learn user preferences and predict future content consumption <ref type="bibr" target="#b0">[1,</ref><ref type="bibr" target="#b1">2,</ref><ref type="bibr" target="#b2">3,</ref><ref type="bibr" target="#b3">4,</ref><ref type="bibr" target="#b4">5]</ref>.</p><p>It has been widely documented that music recommendation systems suffer from popularity bias as they tend to concentrate recommendation exposure on a limited fraction of artists, often overlooking new and emerging talent <ref type="bibr" target="#b5">[6,</ref><ref type="bibr" target="#b6">7,</ref><ref type="bibr" target="#b7">8,</ref><ref type="bibr" target="#b8">9,</ref><ref type="bibr" target="#b9">10,</ref><ref type="bibr" target="#b10">11]</ref>. As the success and visibility of artists are deeply influenced by the algorithms of these platforms, this can lead to a considerable imbalance in the music industry <ref type="bibr" target="#b11">[12,</ref><ref type="bibr" target="#b12">13]</ref> and reinforce existing inequalities <ref type="bibr" target="#b13">[14,</ref><ref type="bibr" target="#b14">15]</ref>. As a result, artists have started to fight for more transparency and fairer payments for online streaming services. The "Justice at Spotify" campaign, launched by the Union of Musicians and Allied Workers <ref type="bibr" target="#b15">[16]</ref>, has been signed by more than 28,000 artists. At the same time, the International Society for Music Information Retrieval has been arguing for promoting the discovery of less popular artists by recommending 'long-tail' items <ref type="bibr" target="#b16">[17]</ref>, as have other researchers <ref type="bibr" target="#b17">[18,</ref><ref type="bibr" target="#b18">19,</ref><ref type="bibr" target="#b19">20]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Proposed strategy</head><p>We explore algorithmic collective action as a means for emerging artists to gain exposure in ML-powered recommender systems by mobilizing their fan base. Algorithmic collective action <ref type="bibr" target="#b20">[21]</ref> describes the coordinated effort of a group of individuals to strategically report the part of the training data they control in order to impact the outcomes of a learning algorithm.</p><p>In music recommender systems the training data consists of user-generated playlists 𝑝. Each playlist is composed of an ordered list of songs. We want collective action to preserve user experience. Thus, we design collective action strategies under an authenticity constraint:</p><formula xml:id="formula_0">A strategy ℎ : 𝑝 → 𝑝 ′ is authentic iff: Lev(𝑝, ℎ(𝑝)) ≤ 1</formula><p>where Lev denotes the Levenshtein distance <ref type="bibr" target="#b21">[22]</ref>, also known as edit distance in information theory, counting the number of operations needed to transform one sequence into another.</p><p>We propose a concrete strategy that satisfies this constraint. Our strategy consists of inserting an agreed-upon target song 𝑠 * at a specific position in the playlist, as shown in Figure <ref type="figure" target="#fig_1">2</ref>. The position 𝑖 to insert the song 𝑠 * is chosen by identifying the least likely song 𝑠 0 among the songs in the playlist 𝑝 and placing 𝑠 * right after 𝑠 0 . Intuition for the strategy. Sequential recommenders are trained to approximate the conditional distributions of songs. For a given context window, the model then recommends one of the top 𝐾 most likely songs to follow this context. Our strategy aims to exploit contexts that are overrepresented in the data the collective controls to increase the chance of meeting the top 𝐾 threshold. To this end, it selects contexts that end on a low-frequency song (for small collectives, these typically appear only once in the controlled playlists). To find these low-frequency songs participants of the collective can share information about the playlists they own, gather stream counts by scraping Spotify playlists, or use public APIs to gather external song statistics.</p><formula xml:id="formula_1">! ! ! * … ! ! … ! "#$ ! "%&amp; " ! * " " ! * #</formula><p>Notice that the probabilistic assumption on the sequence model is not specific to the model architecture or the training algorithm used. This makes the strategy robust and easy to implement in practice.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Success of collective action</head><p>We empirically test the success of our strategy against a recent transformer-based automatic playlist continuation model <ref type="bibr" target="#b3">[4]</ref>. The model has been deployed and made publicly available by Deezer-one of the biggest streaming platforms in the world. To train the model we use the Spotify million playlist dataset <ref type="bibr" target="#b22">[23]</ref>, treating each playlist as a user, and randomly sampling a small 𝛼-fraction to compose the collective. We find that by strategically placing the target song, small collectives can achieve disproportional representation at test time, see Figure <ref type="figure" target="#fig_0">1</ref>. The star shows that a collective of size 1% can achieve that the target song is recommended in 6% of the playlist continuations at test time. This corresponds to a factor 6 amplification comparing training time and test time occurrences. In contrast, placing the song at the end of every playlist is largely ineffective. Also interesting to observe in Figure <ref type="figure" target="#fig_0">1</ref> is that a similar strategy does not seem to be implemented by any artist in the investigated data.</p><p>We further experiment with collective sizes from 0.03% to 3%, and show amplification in Figure <ref type="figure">3</ref>. Interestingly, even tiny user collectives, controlling as few as 60 out of 1 million playlists can achieve an amplification of 25×. This is 40× more than an average song occurring at the same frequency in the training data. Notably, this can be achieved by choosing the position at which to insert one song strategically, while leaving the rest of the playlist untouched.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Externalities</head><p>As we have seen, collective action offers an effective lever for platform participants to promote their interests on algorithm-driven platforms. However, strategies can only be effective if they are not creating equally strong incentives for other players in the system to counter them. In Songs are sorted by their training set frequency and aggregated into 50 evenly spaced bins with 95% CI.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Table 1</head><p>Effect on recommendation performance-measured using standard metrics <ref type="bibr" target="#b23">[24]</ref>: Normalized Discounted Cumulative Gain (NDCG), R-precision, and number of clicks to find relevant song (#C). the following we study the externalities of our strategy, choosing 𝛼 = 1%. First, we focus on the effect of our strategy on other artists. In Figure <ref type="figure">4</ref>, we visualize the change in total recommendation counts for individual songs, binned according to their training set frequency. The purple star indicates the song promoted by the collective. We find that the gained recommendations are taken from songs of varying popularity levels, and no artist appears to be affected disproportionally.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Performance</head><p>Second, we focus on the effect of our strategy on the recommendation performance. Table <ref type="table">4</ref> shows performance along multiple metrics. The loss seems to be very small for the platform. In comparison, the last column shows an alternative strategy with the same success, but replacing a relevant song every time 𝑠 * is recommended. This shows that the gained recommendations often replace irrelevant songs causing relatively little harm. Similarly, we see little performance drop for the platform participants, suggesting that their recommendations are also widely preserved at test time. If the song were to be actually relevant for individuals in the collective such a strategy could even help increase recommendation performance.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Conclusion</head><p>We designed an easy-to-implement collective action strategy under a natural authenticity constraint. We demonstrated that it can be effective in promoting a target song even for tiny collectives, while minimally impairing overall user experience. This suggests a widely unexplored design space for effective collective action strategies that differ from typical adversarial data poisoning attacks [c.f. <ref type="bibr" target="#b24">25,</ref><ref type="bibr" target="#b25">26,</ref><ref type="bibr" target="#b26">27,</ref><ref type="bibr" target="#b27">28]</ref>. They offer a powerful data lever <ref type="bibr" target="#b28">[29,</ref><ref type="bibr" target="#b29">30]</ref>, and an approach to participatory AI <ref type="bibr" target="#b30">[31]</ref>. Thus, understanding the role of economic power <ref type="bibr" target="#b31">[32,</ref><ref type="bibr" target="#b32">33]</ref>, formalizing incentives <ref type="bibr" target="#b33">[34]</ref>, as well as quantifying long-term payoffs, dynamics and equilibria under collective action promises to be a fruitful direction for future work. <ref type="foot" target="#foot_0">1</ref></p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: By strategically choosing the position at which to insert a song in a playlist, collectives can achieve a disproportional amplification in recommendation frequency relative to training set occurrences, compared to other songs.</figDesc><graphic coords="2,162.21,84.19,270.85,201.40" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: Song insertion strategy: placing the target song 𝑠 * right after 𝑠 0 in a playlist of length 𝐿.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 3 :Figure 4 :</head><label>34</label><figDesc>Figure 3: Empirical amplification of our proposed strategy with different levels of information (compared to two baselines Random and AtTheEnd).</figDesc></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="1" xml:id="foot_0">An extended version of the paper can be found on arXiv<ref type="bibr" target="#b34">[35]</ref>.</note>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Acknowledgments</head><p>We would like to thank Moritz Hardt for many insightful and formative discussions throughout the course of this work. We would also like to thank Mila Gorecki, Ricardo Dominguez-Olmedo, Ana-Andreea Stoica, and André Cruz for invaluable feedback on the manuscript, and Olawale Salaudeen, Florian Dorner, Stefania Ionescu, and Tijana Zrnic for helpful feedback on earlier versions of this work. We would also like to thank the anonymous reviewers for their feedback.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Contextual and sequential user embeddings for large-scale music recommendation</title>
		<author>
			<persName><forename type="first">C</forename><surname>Hansen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Hansen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Maystre</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Mehrotra</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Brost</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Tomasi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Lalmas</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 14th ACM Conference on Recommender Systems</title>
				<meeting>the 14th ACM Conference on Recommender Systems</meeting>
		<imprint>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="53" to="62" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Automatic music playlist generation via simulation-based reinforcement learning</title>
		<author>
			<persName><forename type="first">F</forename><surname>Tomasi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Cauteruccio</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Kanoria</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Ciosek</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Rinaldi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Dai</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD &apos;23</title>
				<meeting>the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD &apos;23</meeting>
		<imprint>
			<date type="published" when="2023">2023</date>
			<biblScope unit="page" from="4948" to="4957" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Exploiting sequential music preferences via optimisation-based sequencing</title>
		<author>
			<persName><forename type="first">D</forename><surname>Moor</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Yuan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Mehrotra</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Dai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Lalmas</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 32nd ACM International Conference on Information and Knowledge Management</title>
				<meeting>the 32nd ACM International Conference on Information and Knowledge Management</meeting>
		<imprint>
			<date type="published" when="2023">2023</date>
			<biblScope unit="page" from="4759" to="4765" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">A Scalable Framework for Automatic Playlist Continuation on Music Streaming Services</title>
		<author>
			<persName><forename type="first">W</forename><surname>Bendada</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Salha-Galvan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Bouabça</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Cazenave</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval</title>
				<meeting>the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval</meeting>
		<imprint>
			<date type="published" when="2023">2023</date>
			<biblScope unit="page" from="464" to="474" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Track Mix Generation on Music Streaming Services Using Transformers</title>
		<author>
			<persName><forename type="first">W</forename><surname>Bendada</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Bontempelli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Morlon</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Chapus</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Cador</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Bouabça</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Salha-Galvan</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 17th ACM Conference on Recommender Systems</title>
				<meeting>the 17th ACM Conference on Recommender Systems</meeting>
		<imprint>
			<date type="published" when="2023">2023</date>
			<biblScope unit="page" from="112" to="115" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Requiem for the long tail: Towards a political economy of content aggregation and fragmentation</title>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">M</forename><surname>Napoli</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">International Journal of Media &amp; Cultural Politics</title>
		<imprint>
			<biblScope unit="volume">12</biblScope>
			<biblScope unit="page" from="341" to="356" />
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Music recommender systems: challenges and opportunities for non-superstar artists</title>
		<author>
			<persName><forename type="first">C</forename><surname>Bauer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Kholodylo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Strauss</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">30th Bled eConference</title>
				<imprint>
			<date type="published" when="2017">2017</date>
			<biblScope unit="page" from="21" to="32" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Allowing for equal opportunities for artists in music recommendation</title>
		<author>
			<persName><forename type="first">C</forename><surname>Bauer</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 1st Workshop on Human-Centric Music Information Research Systems</title>
				<meeting>the 1st Workshop on Human-Centric Music Information Research Systems</meeting>
		<imprint>
			<date type="published" when="2019">2019</date>
			<biblScope unit="page" from="16" to="18" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Digital music and the &quot;death of the long tail</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">P</forename><surname>Coelho</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">Z</forename><surname>Mendes</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Business Research</title>
		<imprint>
			<biblScope unit="volume">101</biblScope>
			<biblScope unit="page" from="454" to="460" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<monogr>
		<title level="m" type="main">Data shows 90 percent of streams go to the top 1 percent of artists</title>
		<author>
			<persName><forename type="first">E</forename><surname>Blake</surname></persName>
		</author>
		<ptr target="https://www.rollingstone.com/pro/news/top-1-percent-streaming-1055005" />
		<imprint>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">What recommenders recommend -an analysis of accuracy, popularity, and sales diversity effects</title>
		<author>
			<persName><forename type="first">D</forename><surname>Jannach</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Lerche</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Gedikli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Bonnin</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">User Modeling, Adaptation, and Personalization</title>
				<meeting><address><addrLine>Berlin Heidelberg</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2013">2013</date>
			<biblScope unit="page" from="25" to="37" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Platforms, power, and promotion: Evidence from spotify playlists</title>
		<author>
			<persName><forename type="first">L</forename><surname>Aguiar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Waldfogel</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">The Journal of Industrial Economics</title>
		<imprint>
			<biblScope unit="volume">69</biblScope>
			<biblScope unit="page" from="653" to="691" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Platform pop: disentangling spotify&apos;s intermediary role in the music industry</title>
		<author>
			<persName><forename type="first">R</forename><surname>Prey</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">Esteve</forename><surname>Del Valle</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Zwerwer</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Information, Communication &amp; Society</title>
		<imprint>
			<biblScope unit="volume">25</biblScope>
			<biblScope unit="page" from="74" to="92" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Diversity by design in music recommender systems</title>
		<author>
			<persName><forename type="first">L</forename><surname>Porcaro</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Castillo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Gómez</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Transactions of the International Society for Music Information Retrieval</title>
				<imprint>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Splendid Isolation&quot;: The reproduction of music industry inequalities in Spotify&apos;s recommendation system</title>
		<author>
			<persName><forename type="first">T</forename><surname>Tofalvy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Koltai</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">New Media &amp; Society</title>
		<imprint>
			<biblScope unit="volume">25</biblScope>
			<biblScope unit="page" from="1580" to="1604" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<monogr>
		<ptr target="https://weareumaw.org/justice-at-spotify" />
		<title level="m">Justice at Spotify</title>
				<imprint>
			<publisher>Union of Musicians and Allied Workers</publisher>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Report on the ISMIR 2020 special session: how do we help artists?</title>
		<author>
			<persName><forename type="first">C</forename><surname>Bauer</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">ACM SIGIR Forum</title>
		<imprint>
			<biblScope unit="volume">54</biblScope>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<monogr>
		<title level="m" type="main">Music Recommendation and Discovery: The Long Tail, Long Fail, and Long Play in the Digital Music Space</title>
		<author>
			<persName><forename type="first">Ò</forename><surname>Celma</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2010">2010</date>
			<publisher>Springer</publisher>
			<pubPlace>Berlin, Heidelberg</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<monogr>
		<title level="m" type="main">Five approaches to collecting tags for music</title>
		<author>
			<persName><forename type="first">D</forename><surname>Turnbull</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Barrington</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Lanckriet</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2008">2008</date>
			<publisher>ISMIR</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Music recommendation: Audio neighbourhoods to discover music in the long tail</title>
		<author>
			<persName><forename type="first">S</forename><surname>Craw</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Horsburgh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Massie</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Case-Based Reasoning Research and Development</title>
				<imprint>
			<publisher>Springer International Publishing</publisher>
			<date type="published" when="2015">2015</date>
			<biblScope unit="page" from="73" to="87" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">Algorithmic Collective Action in Machine Learning</title>
		<author>
			<persName><forename type="first">M</forename><surname>Hardt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Mazumdar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Mendler-Dünner</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Zrnic</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 40th International Conference on Machine Learning</title>
				<meeting>the 40th International Conference on Machine Learning</meeting>
		<imprint>
			<publisher>PMLR</publisher>
			<date type="published" when="2023">2023</date>
			<biblScope unit="volume">202</biblScope>
			<biblScope unit="page" from="12570" to="12586" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">Binary codes capable of correcting deletions, insertions and reversals</title>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">I</forename><surname>Levenshtein</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Soviet Physics Doklady</title>
		<imprint>
			<biblScope unit="volume">10</biblScope>
			<biblScope unit="page">707</biblScope>
			<date type="published" when="1966">1966</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Recsys Challenge 2018: Automatic Music Playlist Continuation</title>
		<author>
			<persName><forename type="first">C.-W</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Lamere</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Schedl</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Zamani</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 12th ACM Conference on Recommender Systems, RecSys &apos;18</title>
				<meeting>the 12th ACM Conference on Recommender Systems, RecSys &apos;18</meeting>
		<imprint>
			<date type="published" when="2018">2018</date>
			<biblScope unit="page" from="527" to="528" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<analytic>
		<title level="a" type="main">An Analysis of Approaches Taken in the ACM RecSys Challenge 2018 for Automatic Music Playlist Continuation</title>
		<author>
			<persName><forename type="first">H</forename><surname>Zamani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Schedl</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Lamere</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C.-W</forename><surname>Chen</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">ACM Trans. Intell. Syst. Technol</title>
		<imprint>
			<biblScope unit="volume">10</biblScope>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">A comprehensive survey on poisoning attacks and countermeasures in machine learning</title>
		<author>
			<persName><forename type="first">Z</forename><surname>Tian</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Cui</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Liang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Yu</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">ACM Comput. Surv</title>
		<imprint>
			<biblScope unit="volume">55</biblScope>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<analytic>
		<title level="a" type="main">Practical data poisoning attack against next-item recommendation</title>
		<author>
			<persName><forename type="first">H</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Ding</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Gao</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of The Web Conference 2020</title>
				<meeting>The Web Conference 2020</meeting>
		<imprint>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="2458" to="2464" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b26">
	<analytic>
		<title level="a" type="main">Black-box attacks on sequential recommenders via data-free model extraction</title>
		<author>
			<persName><forename type="first">Z</forename><surname>Yue</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>He</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Zeng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Mcauley</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 15th ACM Conference on Recommender Systems</title>
				<meeting>the 15th ACM Conference on Recommender Systems</meeting>
		<imprint>
			<date type="published" when="2021">2021</date>
			<biblScope unit="page" from="44" to="54" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b27">
	<analytic>
		<title level="a" type="main">Defending substitution-based profile pollution attacks on sequential recommenders</title>
		<author>
			<persName><forename type="first">Z</forename><surname>Yue</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Zeng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Kou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Shang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Wang</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 16th ACM Conference on Recommender Systems</title>
				<meeting>the 16th ACM Conference on Recommender Systems</meeting>
		<imprint>
			<date type="published" when="2022">2022</date>
			<biblScope unit="page" from="59" to="70" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b28">
	<analytic>
		<title level="a" type="main">Data Strikes&quot;: Evaluating the Effectiveness of a New Form of Collective Action Against Technology Companies</title>
		<author>
			<persName><forename type="first">N</forename><surname>Vincent</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Hecht</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Sen</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">The World Wide Web Conference</title>
				<imprint>
			<date type="published" when="2019">2019</date>
			<biblScope unit="page" from="1931" to="1943" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b29">
	<analytic>
		<title level="a" type="main">Data Leverage: A Framework for Empowering the Public in Its Relationship with Technology Companies</title>
		<author>
			<persName><forename type="first">N</forename><surname>Vincent</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Tilly</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Chancellor</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Hecht</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency, FAccT &apos;21</title>
				<meeting>the 2021 ACM Conference on Fairness, Accountability, and Transparency, FAccT &apos;21</meeting>
		<imprint>
			<date type="published" when="2021">2021</date>
			<biblScope unit="page" from="215" to="227" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b30">
	<analytic>
		<title level="a" type="main">Power to the people? opportunities and challenges for participatory ai</title>
		<author>
			<persName><forename type="first">A</forename><surname>Birhane</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Isaac</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Prabhakaran</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Diaz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">C</forename><surname>Elish</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Gabriel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Mohamed</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2nd ACM Conference on Equity and Access in Algorithms, Mechanisms, and Optimization</title>
				<meeting>the 2nd ACM Conference on Equity and Access in Algorithms, Mechanisms, and Optimization</meeting>
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b31">
	<analytic>
		<title level="a" type="main">Performative Power</title>
		<author>
			<persName><forename type="first">M</forename><surname>Hardt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Jagadeesan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Mendler-Dünner</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Advances in Neural Information Processing Systems</title>
				<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b32">
	<monogr>
		<author>
			<persName><forename type="first">M</forename><surname>Hardt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Mendler-Dünner</surname></persName>
		</author>
		<idno type="arXiv">arXiv:2310.16608</idno>
		<title level="m">Performative prediction: Past and future</title>
				<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

<biblStruct xml:id="b33">
	<monogr>
		<author>
			<persName><forename type="first">M</forename><surname>Olson</surname></persName>
		</author>
		<title level="m">The logic of collective action: public goods and the theory of groups</title>
				<imprint>
			<publisher>Harvard University Press</publisher>
			<date type="published" when="1965">1965</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b34">
	<monogr>
		<title level="m" type="main">Algorithmic collective action in recommender systems: Promoting songs by reordering playlists</title>
		<author>
			<persName><forename type="first">J</forename><surname>Baumann</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Mendler-Dünner</surname></persName>
		</author>
		<idno type="arXiv">arXiv:2404.04269</idno>
		<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
	<note type="report_type">ArXiv preprint</note>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
