The paper investigates welfare‑maximizing allocation of heterogeneous objects when agents use costly effort for screening instead of monetary transfers. It shows that as the number of object types increases, no‑screening mechanisms become more efficient, reducing the need for screening. The authors prove that in a symmetric continuous market with i.i.d. log‑concave values, the multidimensional allocation problem collapses to a single‑dimensional one based on agents’ best‑option values, and they demonstrate that this no‑screening optimality persists even as variety expands, supported by large‑variety limits and numerical experiments. The findings are applied to design an invitation‑based vaccine appointment system.
By Shunya Noda, Genta Okada
arXiv:2602. 17894v2 Announce Type: replace-cross Abstract: Data collection is a critical component of modern statistical and machine learning pipelines, particularly when data must be gathered from multiple heterogeneous sources to study a target population of interest.
By Michael O. Harding, Vikas Singh, Kirthevasan Kandasamy
arXiv:2606. 08360v1 Announce Type: cross Abstract: Peer-referral recruitment systems such as respondent-driven sampling are critical for studying and intervening on hidden populations affected by infectious diseases.
By Lingkai Kong, Hezi Jiang, Andrew Ma, Keyu Wang, Akseli Kangaslahti, Milind Tambe
arXiv:2606. 18679v1 Announce Type: cross Abstract: We study the problem of fair online resource allocation, motivated by applications such as refugee resettlement and airline scheduling, where agents arrive sequentially and must be assigned to facilities with limited capacities.
By Christopher En, Yuri Faenza, Andrea Lodi, Gonzalo Mu\~noz
The paper introduces a formal framework for Simulation-Augmented Generation (SAGE), a method that simulates individual viewpoints to answer contentious queries more representatively. By applying the metric proportional justified representation+ (mPJR+) axiom from proportional clustering, the authors prove that only a small number of simulations (n ≪ n_H) and dynamic routing to an even smaller subset (k ≪ n) are sufficient to approximate proportional representation for a large population. Empirical results on political and personal advice domains show that their routing algorithm outperforms k‑means and random selection baselines in achieving higher mPJR+ satisfaction rates.
By Sonja Kraiczy, Smitha Milli, Ratip Emin Berker, Avinandan Bose, Brandon Amos, Jamelle Watson-Daniels, Maximilian Nickel, Edith Elkind, Ariel D. Procaccia
arXiv:2606. 30932v1 Announce Type: new Abstract: Two-sided marketplaces connect distinct user groups whose interests often conflict -- improving outcomes on one side could degrade the other side's experience.
By Yufei Wu, Zhen Yan
arXiv:2606. 20461v1 Announce Type: new Abstract: Machine learning models have been shown to exhibit discriminatory outcomes or degraded performance for individuals at the intersection of multiple sensitive attributes, such as race and gender.
By Bruno Scarone, Alfredo Viola, Ren\'ee J. Miller
arXiv:2607. 26485v1 Announce Type: cross Abstract: Resource allocation across multiple agent groups arises in many applications including e-commerce recommendation systems, housing assignment, and course allocation, and is commonly formulated as an optimization problem with diversity constraints to ensure group fairness.
By Keke Huang, Yik Yu Ng, Laks V. S. Lakshmanan, Xiaokui Xiao
arXiv:2605. 12111v2 Announce Type: replace Abstract: We study a sequential resource allocation problem motivated by adaptive network recruitment, in which a limited budget of identical resources must be allocated over multiple rounds to individuals with stochastic referral capacity.
By Yuqi Pan, Davin Choo, Haichuan Wang, Milind Tambe, Alastair van Heerden, Cheryl Johnson
arXiv:2607. 23310v1 Announce Type: cross Abstract: We study an online variant of discrete fair division under generalized assignment budget constraints.
By Saar Cohen, Nicholas Teh, Paul W. Goldberg, Michael J. Wooldridge
arXiv:2605. 27689v2 Announce Type: replace Abstract: When machine learning systems under-perform for particular subgroups, affected users typically have no way to correct these disparities without relying on platform-level fixes.
By Meghana Bhange, Ulrich A\"ivodji, Elliot Creager
arXiv:2607. 09802v1 Announce Type: new Abstract: The escalating demand for Machine Learning (ML) training resources in recent years has resulted in a substantial gap between the high demand and the available supply.
By Balasubramanian Sivan, Renato Paes Leme, Mihai Tiuca, Ian McFarlane, Vasilis Gkatzelis, Nehal Mehta, Soheil Hassas Yeganeh, Vahab Mirrokni, Amin Vahdat