SearcharxivSearch

arXiv subjects

Madeline Kitch

Publications and source records attributed to Madeline Kitch.

2 recordsLinked to original sources

Can Users Fix Algorithms? A Game-Theoretic Analysis of Collective Content Amplification in Recommender Systems

Users of social media platforms based on recommendation systems (e.g. TikTok, X, YouTube) strategically interact with platform content to influence future recommendations. On some such platforms, users have been documented to form large-scale grassroots movements encouraging others to purposefully interact with algorithmically suppressed content in order to counteractively ``boost'' its recommendation. However, despite widespread documentation of this phenomenon, there is little theoretical work analyzing its impact on the platform or users themselves. We study a game between users and a RecSys, where users (potentially strategically) interact with the content available to them, and the RecSys -- limited by preference learning ability -- provides each user her approximately most-preferred item. We compare recommendations and social welfare when users interact with content according to their personal interests and when a collective of users intentionally interacts with an otherwise suppressed item. We provide sufficient conditions to ensure a pareto improvement in recommendations and strict increases in user social welfare under collective interaction, and provide a robust algorithm to find an effective collective strategy. Interestingly, despite the intended algorithmic protest of these movements, we show that for commonly assumed recommender utility functions, effective collective strategies also improve the utility of the RecSys. Our theoretical analysis is complemented by empirical results of effective collective interaction strategies on the GoodReads dataset and an online survey on how real-world users attempt to influence others' recommendations on RecSys platforms. Our findings examine how and when platforms' recommendation algorithms may incentivize users to collectivize and interact with content in algorithmic protest as well as what this collectivization means for the platform.

cs.GT

Rent Division with Picky Roommates

How can one assign roommates and rooms when tenants have preferences for both where and with whom they live? In this setting, the usual notions of envy-freeness and maximizing social welfare may not hold; the roommate rent-division problem is assumed to be NP-hard, and even when welfare is maximized, an envy-free price vector may not exist. We first construct a novel greedy algorithm with bipartite matching before exploiting the connection between social welfare maximization and the maximum weighted independent set (MWIS) problem to construct a polynomial-time algorithm that gives a $\frac{3}{4}+\varepsilon$-approximation of maximum social welfare. Further, we present an integer program to find a room envy-free price vector that minimizes envy between any two tenants. We show empirically that a MWIS algorithm returns the optimal allocation in polynomial time and conjecture that this problem, at the forefront of computer science research, may have an exact polynomial algorithm solution. This study not only advances the theoretical framework for roommate rent division but also offers practical algorithmic solutions that can be implemented in real-world applications.

cs.GT