5 citations · 10 across the 6 of their papers we have counts for
10 papers
Graphic Matroid Secretary without the Graph
Paul Dütting, Renato Paes Leme, Martin Pál +1
The matroid secretary problem (MSP) is one of the cleanest, and most captivating open problems in online algorithms. The famous MSP conjecture stipulates that there exists a consta…
Online Matroid Embeddings
Andrés Cristi, Paul Dütting, Robert Kleinberg +2
We introduce the notion of an online matroid embedding, which is an algorithm for mapping an unknown matroid that is revealed in an online fashion to a larger-but-known matroid. We…
On Supermodular Contracts and Dense Subgraphs
Ramiro Deo-Campo Vuong, Shaddin Dughmi, Neel Patel +1
We study the combinatorial contract design problem, introduced and studied by Dutting et. al. (2021, 2022), in both the single and multi-agent settings. Prior work has examined the…
On Sparsification of Stochastic Packing Problems
Shaddin Dughmi, Yusuf Hakan Kalayci, Neel Patel
Motivated by recent progress on stochastic matching with few queries, we embark on a systematic study of the sparsification of stochastic packing problems (SPP) more generally. Spe…
Delegated Pandora's box
Curtis Bechtel, Shaddin Dughmi, Neel Patel
In delegation problems, a principal does not have the resources necessary to complete a particular task, so they delegate the task to an untrusted agent whose interests may differ…
The Price is (Probably) Right: Learning Market Equilibria from Samples
Vignesh Viswanathan, Omer Lev, Neel Patel +1
Equilibrium computation in markets usually considers settings where player valuation functions are known. We consider the setting where player valuations are unknown; using a PAC l…
Model Explanations with Differential Privacy
Neel Patel, Reza Shokri, Yair Zick
Black-box machine learning models are used in critical decision-making domains, giving rise to several calls for more algorithmic transparency. The drawback is that model explanati…
High Dimensional Model Explanations: an Axiomatic Approach
Neel Patel, Martin Strobel, Yair Zick
Complex black-box machine learning models are regularly used in critical decision-making domains. This has given rise to several calls for algorithmic explainability. Many explanat…
Keeping Your Friends Close: Land Allocation with Friends
Edith Elkind, Neel Patel, Alan Tsang +1
We examine the problem of assigning plots of land to prospective buyers who prefer living next to their friends. They care not only about the plot they receive, but also about thei…
Discrete Richman-bidding Scoring Games
Urban Larsson, Neel Patel, Ravi Kant Rai
We study zero-sum (combinatorial) games, within the framework of so-called Richman auctions (Lazarus et al. 1996) namely, we modify the alternating play scoring ruleset Cumulative…