Qiqi Yan

Inbal Talgam-Cohen

Oper. Res., 2020

Robust mechanisms for risk-averse sellers.

[BibT_eX]

[DOI]

Games Econ. Behav., 2020

2019

Design of LED Display Screen Based on Soft Font Library.

[BibT_eX]

[DOI]

Proceedings of the ICSCC 2019: 5th International Conference on Systems, 2019

How Important is a Neuron.

[BibT_eX]

[DOI]

Kedar Dhamdhere

Proceedings of the 7th International Conference on Learning Representations, 2019

2018

The Cascading Analysts Algorithm.

[BibT_eX]

[DOI]

Matthias Ruhl

Proceedings of the 2018 International Conference on Management of Data, 2018

2017

A Simple and Efficient MapReduce Algorithm for Data Cube Materialization.

[BibT_eX]

[DOI]

CoRR, 2017

Hierarchical Summarization of Metric Changes.

[BibT_eX]

[DOI]

Matthias Ruhl

CoRR, 2017

Analyza: Exploring Data with Conversation.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Intelligent User Interfaces, 2017

Axiomatic Attribution for Deep Networks.

[BibT_eX]

[DOI]

Ankur Taly

Proceedings of the 34th International Conference on Machine Learning, 2017

2016

Whole-Page Optimization and Submodular Welfare Maximization with Online Bidders.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2016

Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding.

[BibT_eX]

[DOI]

Shaddin Dughmi

J. ACM, 2016

Gradients of Counterfactuals.

[BibT_eX]

[DOI]

Ankur Taly

CoRR, 2016

2015

Envy freedom and prior-free mechanism design.

[BibT_eX]

[DOI]

Nikhil R. Devanur

Jason D. Hartline

J. Econ. Theory, 2015

Revenue maximization with a single sample.

[BibT_eX]

[DOI]

Peerapong Dhangwatnotai

Games Econ. Behav., 2015

2012

Prior-independence: a new lens for mechanism design.

[BibT_eX]

[DOI]

PhD thesis, 2012

Supply-limiting mechanisms.

[BibT_eX]

[DOI]

Inbal Talgam-Cohen

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

2011

An approximately truthful-in-expectation mechanism for combinatorial auctions using value queries

[BibT_eX]

[DOI]

CoRR, 2011

From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions for Submodular Bidders

[BibT_eX]

[DOI]

Shaddin Dughmi

CoRR, 2011

Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs.

[BibT_eX]

[DOI]

Mohammad Mahdian

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

From convex optimization to randomized mechanisms: toward optimal combinatorial auctions.

[BibT_eX]

[DOI]

Shaddin Dughmi

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Mechanism Design via Correlation Gap.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Envy, truth, and profit.

[BibT_eX]

[DOI]

Jason D. Hartline

Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

2008

Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2008

2007

Classifying regular languages by a split game.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

On the Price of Truthfulness in Path Auctions.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

2006

Lower Bounds for Complementation of <i>omega</i>-Automata Via the Full Automata Technique.

[BibT_eX]

[DOI]