Author Description

Login to generate an author description

Ask a Question About This Mathematician

All published works (18)

Action Title Date Authors
On the Power of Randomization for Obviously Strategy-Proof Mechanisms 2025-02-16 Shiri Ron Daniel Schoepflin
Clock Auctions Augmented with Unreliable Advice 2025-01-01 Vasilis Gkatzelis Daniel Schoepflin Xizhi Tan
Clock Auctions Augmented with Unreliable Advice 2024-08-12 Vasilis Gkatzelis Daniel Schoepflin Xizhi Tan
Optimal Mechanisms for Consumer Surplus Maximization 2024-02-26 Tomer Ezra Daniel Schoepflin Ariel Shaulker
Bayesian and Randomized Clock Auctions 2022-07-12 Michal Feldman Vasilis Gkatzelis Nick Gravin Daniel Schoepflin
Deterministic Budget-Feasible Clock Auctions 2022-01-01 Eric Balkanski Pranav Garimidi Vasilis Gkatzelis Daniel Schoepflin Xizhi Tan
Beyond Cake Cutting: Allocating Homogeneous Divisible Goods 2022-01-01 Ioannis Caragiannis Vasilis Gkatzelis Alexandros Psomas Daniel Schoepflin
Bayesian and Randomized Clock Auctions 2022-01-01 Michal Feldman Vasilis Gkatzelis Nick Gravin Daniel Schoepflin
PROPm Allocations of Indivisible Goods to Multiple Agents 2021-08-01 Artem Baklanov Pranav Garimidi Vasilis Gkatzelis Daniel Schoepflin
Prior-Free Clock Auctions for Bidders with Interdependent Values 2021-07-20 Vasilis Gkatzelis R. Patel Emmanouil Pountourakis Daniel Schoepflin
+
PROPm Allocations of Indivisible Goods to Multiple Agents 2021-05-24 Artem Baklanov Pranav Garimidi Vasilis Gkatzelis Daniel Schoepflin
Achieving Proportionality up to the Maximin Item with Indivisible Goods 2021-05-18 Artem Baklanov Pranav Garimidi Vasilis Gkatzelis Daniel Schoepflin
Achieving Proportionality up to the Maximin Item with Indivisible Goods. 2021-05-18 Artem Baklanov Pranav Garimidi Vasilis Gkatzelis Daniel Schoepflin
Deterministic Budget-Feasible Clock Auctions 2021-01-01 Eric Balkanski Pranav Garimidi Vasilis Gkatzelis Daniel Schoepflin Xizhi Tan
Prior-Free Clock Auctions for Bidders with Interdependent Values 2021-01-01 Vasilis Gkatzelis R. Patel Emmanouil Pountourakis Daniel Schoepflin
Prior-Free Clock Auctions for Bidders with Interdependent Values 2021-01-01 Vasilis Gkatzelis R. Patel Emmanouil Pountourakis Daniel Schoepflin
PROPm Allocations of Indivisible Goods to Multiple Agents 2021-01-01 Artem Baklanov Pranav Garimidi Vasilis Gkatzelis Daniel Schoepflin
Achieving Proportionality up to the Maximin Item with Indivisible Goods 2020-01-01 Artem Baklanov Pranav Garimidi Vasilis Gkatzelis Daniel Schoepflin

Commonly Cited References

Action Title Date Authors # of times referenced
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation 2020-07-09 Haris Aziz Hervé Moulin Fedor Sandomirskiy 3
Fair Public Decision Making 2017-06-20 Vincent Conitzer Rupert Freeman Nisarg Shah 3
Finding Fair and Efficient Allocations 2018-06-11 Siddharth Barman Sanath Kumar Krishnamurthy Rohit Vaish 3
APX-hardness of maximizing Nash social welfare with indivisible items 2017-02-23 Euiwoong Lee 3
Auctions with Interdependence and SOS: Improved Approximation 2021-01-01 Ameer Amer Inbal Talgam-Cohen 2
Achieving Proportionality up to the Maximin Item with Indivisible Goods 2021-05-18 Artem Baklanov Pranav Garimidi Vasilis Gkatzelis Daniel Schoepflin 2
On the Computational Complexity of Optimal Simple Mechanisms 2016-01-05 Aviad Rubinstein 2
Welfare Maximization with Deferred Acceptance Auctions in Reallocation Problems 2015-01-01 Anthony Kim 2
Almost Envy-Freeness with General Valuations 2018-01-01 Benjamin Plaut Tim Roughgarde 2
Interdependent Values without Single-Crossing 2018-06-11 Alon Eden Michal Feldman Amos Fiat Kira Goldner 2
A Simple and Approximately Optimal Mechanism for an Additive Buyer 2020-06-16 Moshe Babaioff Nicole Immorlica Brendan Lucier S. Matthew Weinberg 2
Approximate revenue maximization in interdependent value settings 2014-05-30 Shuchi Chawla Hu Fu Anna R. Karlin 2
Almost envy-freeness with general valuations 2018-01-07 Benjamin Plaut Tim Roughgarden 2
A Little Charity Guarantees Almost Envy-Freeness 2019-12-23 Bhaskar Ray Chaudhury Telikepalli Kavitha Kurt Mehlhorn Alkmini Sgouritsa 2
Prophet secretary through blind strategies 2019-01-06 José R. Correa Raimundo Saona Bruno Ziliotto 1
Optimal Budget-Feasible Mechanisms for Additive Valuations 2019-01-01 Nick Gravin Yaonan Jin Pinyan Lu Chenhao Zhang 1
Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution 2019-06-17 José R. Correa Paul Dütting Felix Fischer Kevin Schewior 1
Approximation Algorithms for Maximin Fair Division 2020-02-29 Siddharth Barman Sanath Kumar Krishnamurthy 1
Fairly Allocating Many Goods with Few Queries 2019-07-17 Hoon Oh Ariel D. Procaccia Warut Suksompong 1
Prophets and Secretaries with Overbooking 2018-06-11 Tomer Ezra Michal Feldman Ilan Nehama 1
Prophet Secretary for Combinatorial Auctions and Matroids 2018-01-01 Soheil Ehsani MohammadTaghi Hajiaghayi Thomas Keßelheim Sahil Singla 1
Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination 2020-04-03 Georgios Amanatidis Evangelos Markakis Apostolos Ntokos 1
Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs 2020-01-01 Paul Dütting Michal Feldman Thomas Keßelheim Brendan Lucier 1
Simple, Credible, and Approximately-Optimal Auctions 2020-07-09 Constantinos Daskalakis Maxwell Fishelson Brendan Lucier Vasilis Syrgkanis Santhoshini Velusamy 1
Credible, Truthful, and Two-Round (Optimal) Auctions via Cryptographic Commitments 2020-07-09 Matheus V. X. Ferreira S. Matthew Weinberg 1
An Improved Approximation Algorithm for Maximin Shares 2020-07-09 Jugal Garg Setareh Taki 1
Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination 2020-07-16 Georgios Amanatidis Evangelos Markakis Apostolos Ntokos 1
Budget Feasible Mechanisms for Experimental Design 2014-01-01 Thibaut Horel Stratis Ioannidis S. Muthukrishnan 1
An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions 2020-11-01 Paul Dütting Thomas Keßelheim Brendan Lucier 1
Fairly Allocating Many Goods with Few Queries 2021-01-01 Hoon Oh Ariel D. Procaccia Warut Suksompong 1
Efficient two-sided markets with limited information 2021-06-15 Paul Dütting Federico Fusco Philip Lazos Stefano Leonardi Rebecca Reiffenhäuser 1
Auctions with Interdependence and SOS: Improved Approximation 2021-07-19 Ameer Amer Inbal Talgam-Cohen 1
Improved Revenue Bounds for Posted-Price and Second-Price Mechanisms 2021-10-19 Hedyeh Beyhaghi Negin Golrezaei Renato Paes Leme Martin Pál Balasubramanian Sivan 1
Single-Sample Prophet Inequalities via Greedy-Ordered Selection 2022-01-01 Constantine Caramanis Paul Dütting Matthew Faw Federico Fusco Philip Lazos Stefano Leonardi Orestis Papadigenopoulos Emmanouil Pountourakis Rebecca Reiffenhäuser 1
Deterministic Budget-Feasible Clock Auctions 2022-01-01 Eric Balkanski Pranav Garimidi Vasilis Gkatzelis Daniel Schoepflin Xizhi Tan 1
Online Weighted Matching with a Sample 2022-01-01 Haim Kaplan David Naori Danny Raz 1
The Two-Sided Game of Googol and Sample-Based Prophet Inequalities 2019-12-23 José R. Correa Andrés Cristi Boris Epstein José A. Soto 1
Polymatroid Prophet Inequalities 2015-01-01 Paul Dütting Robert Kleinberg 1
Approximation Algorithms for Computing Maximin Share Allocations 2017-01-01 Georgios Amanatidis Evangelos Markakis Afshin Nikzad Amin Saberi 1
Approximation Algorithms for Computing Maximin Share Allocations 2017-10-31 Georgios Amanatidis Evangelos Markakis Afshin Nikzad Amin Saberi 1
Bayesian Budget Feasibility with Posted Pricing 2016-04-11 Eric Balkanski Jason D. Hartline 1
Mechanism Design for Crowdsourcing: An Optimal 1-1/e Competitive Budget-Feasible Mechanism for Large Markets 2014-10-01 Nima Anari Gagan Goel Afshin Nikzad 1
Matroid prophet inequalities 2012-05-19 Robert Kleinberg S. Matthew Weinberg 1
Conducting truthful surveys, cheaply 2012-06-04 Aaron Roth Grant Schoenebeck 1
Budget Feasible Mechanisms 2010-10-01 Yaron Singer 1
Optimization with demand oracles 2012-06-04 Ashwinkumar Badanidiyuru Shahar Dobzinski Sigal Oren 1
On the approximability of budget feasible mechanisms 2011-01-23 Ning Chen Nick Gravin Pinyan Lu 1
The sample complexity of revenue maximization 2014-05-31 Richard Cole Tim Roughgarden 1
Beyond matroids: secretary problem and prophet inequality with general constraints 2016-06-10 Aviad Rubinstein 1
Approximation Algorithms for Maximin Fair Division 2017-06-20 Siddharth Barman Sanath Kumar Krishna Murthy 1