activity
20202025
most citedBreaking the Envy Cycle: Best-of-Both-Worlds Guarantees for Subadditive Valuations

7 citations · 17 across the 12 of their papers we have counts for

collaborators

13 papers

cs.GT2025

Online Combinatorial Allocation with Interdependent Values

Michal Feldman, Simon Mauras, Divyarthi Mohan +1

We study online combinatorial allocation problems in the secretary setting, under interdependent values. In the interdependent model, introduced by Milgrom and Weber (1982), each a…

cs.GT2025★ 1 cited

Two-Sided Matching with Resource-Regional Caps

Felipe Garrido-Lucero, Denis Sokolov, Patrick Loiseau +1

We study two-sided many-to-one matching problems under a novel type of distributional constraints, resource-regional caps. In the context of college admissions, under resource-regi…

cs.GT2025

Stable Marriage: Loyalty vs. Competition

Amit Ronen, Jonah Evan Hess, Yael Belfer +2

We consider the stable matching problem (e.g. between doctors and hospitals) in a one-to-one matching setting, where preferences are drawn uniformly at random. It is known that whe…

cs.GT2024★ 1 cited

Optimal Stopping with Interdependent Values

Simon Mauras, Divyarthi Mohan, Rebecca Reiffenhäuser

We study online selection problems in both the prophet and secretary settings, when arriving agents have interdependent values. In the interdependent values model, introduced in th…

econ.TH2024

Equitable Auctions

Simon Finster, Patrick Loiseau, Simon Mauras +2

We study how auction design shapes surplus division among bidders. We introduce a parsimonious ex post equity notion and examine standard multi-unit auctions. The equity-optimal pr…

cs.GT2024

The Price of Opportunity Fairness in Matroid Allocation Problems

Rémi Castera, Felipe Garrido-Lucero, Patrick Loiseau +3

We consider matroid allocation problems under opportunity fairness constraints: resources need to be allocated to a set of agents under matroid constraints (which include classical…

cs.GT2024★ 2 cited

Private Interdependent Valuations: New Bounds for Single-Item Auctions and Matroids

Alon Eden, Michal Feldman, Simon Mauras +1

We study auction design within the widely acclaimed model of interdependent values, introduced by Milgrom and Weber [1982]. In this model, every bidder has a private signal $s_…

physics.optics2023★ 2 cited

Correlating light fields through disordered media across multiple degrees of freedom

Louisiane Devaud, Bernhard Rauer, Simon Mauras +2

Speckle patterns are inherent features of coherent light propagation through complex media. As a result of interference, they are sensitive to multiple experimental parameters such…

cs.GT2023

Constant Approximation for Private Interdependent Valuations

Alon Eden, Michal Feldman, Kira Goldner +2

The celebrated model of auctions with interdependent valuations, introduced by Milgrom and Weber in 1982, has been studied almost exclusively under private signals $s_1, \ldots, s_…

cs.GT2023★ 7 cited

Breaking the Envy Cycle: Best-of-Both-Worlds Guarantees for Subadditive Valuations

Michal Feldman, Simon Mauras, Vishnu V. Narayan +1

We study best-of-both-worlds guarantees for the fair division of indivisible items among agents with subadditive valuations. Our main result establishes the existence of a random a…

cs.GT2023★ 2 cited

On Optimal Tradeoffs between EFX and Nash Welfare

Michal Feldman, Simon Mauras, Tomasz Ponitka

A major problem in fair division is how to allocate a set of indivisible resources among agents fairly and efficiently. The goal of this work is to characterize the tradeoffs betwe…

cs.GT2022★ 2 cited

Truthful Matching with Online Items and Offline Agents

Michal Feldman, Federico Fusco, Stefano Leonardi +2

We study truthful mechanisms for welfare maximization in online bipartite matching. In our (multi-parameter) setting, every buyer is associated with a (possibly private) desired se…

cs.DS2020

Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model

Chien-Chung Huang, Naonori Kakimura, Simon Mauras +1

Maximizing a monotone submodular function under various constraints is a classical and intensively studied problem. However, in the single-pass streaming model, where the elements…