18 citations · 109 across the 28 of their papers we have counts for
7 papers · 1 filter
New Query Lower Bounds for Submodular Function MInimization
Andrei Graur, Tristan Pollner, Vidhya Ramaswamy +1
We consider submodular function minimization in the oracle model: given black-box access to a submodular set function , find an element of $\arg\mi…
Optimal Single-Choice Prophet Inequalities from Samples
Aviad Rubinstein, Jack Z. Wang, S. Matthew Weinberg
We study the single-choice Prophet Inequality problem when the gambler is given access to samples. We show that the optimal competitive ratio of can be achieved with a single…
Persuasion and Incentives Through the Lens of Duality
Shaddin Dughmi, Rad Niazadeh, Alexandros Psomas +1
Lagrangian duality underlies both classical and modern mechanism design. In particular, the dual perspective often permits simple and detail-free characterizations of optimal and a…
Asynchronous Majority Dynamics in Preferential Attachment Trees
Maryam Bahrani, Nicole Immorlica, Divyarthi Mohan +1
We study information aggregation in networks where agents make binary decisions (labeled incorrect or correct). Agents initially form independent private beliefs about the better d…
Approximately Strategyproof Tournament Rules: On Large Manipulating Sets and Cover-Consistence
Ariel Schvartzman, S. Matthew Weinberg, Eitan Zlatin +1
We consider the manipulability of tournament rules, in which teams play a round robin tournament and a winner is (possibly randomly) selected based on the outcome of all $\bino…
Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries
Pravesh Kothari, Divyarthi Mohan, Ariel Schvartzman +2
We consider a revenue-maximizing seller with items facing a single buyer. We introduce the notion of symmetric menu complexity of a mechanism, which counts the number of distin…