| Publication | Date of Publication | Type |
|---|
| Non-stochastic CDF estimation using threshold queries | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7788459 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Optimal oblivious reconfigurable networks
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Revenue monotonicity under misspecified bidders
(available as arXiv preprint) | 2023-03-21 | Paper |
Bernoulli Factories and Black-box Reductions in Mechanism Design
Journal of the ACM | 2022-12-08 | Paper |
Threshold tests as quality signals: optimal strategies, equilibria, and Price of anarchy
(available as arXiv preprint) | 2022-07-06 | Paper |
Optimal stopping with behaviorally biased agents: the role of loss aversion and changing reference points
Games and Economic Behavior | 2022-06-09 | Paper |
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
ACM Transactions on Algorithms | 2022-02-22 | Paper |
A diameter-revealing proof of the Bondy-Lovász lemma
Information Processing Letters | 2021-12-14 | Paper |
| The Lovász theta function for random regular graphs and community detection in the hard regime | 2021-07-28 | Paper |
Full surplus extraction from samples
Journal of Economic Theory | 2021-05-11 | Paper |
Bandits and Experts in Metric Spaces
Journal of the ACM | 2020-02-11 | Paper |
Prior independent mechanisms via prophet inequalities with limited information
Games and Economic Behavior | 2019-12-12 | Paper |
The Lovász theta function for random regular graphs and community detection in the hard regime
SIAM Journal on Computing | 2019-09-02 | Paper |
Prophet Inequalities with Limited Information
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Orienteering for electioneering
Operations Research Letters | 2019-06-11 | Paper |
| Sketching valuation functions | 2019-05-10 | Paper |
Matroid prophet inequalities and applications to multi-dimensional mechanism design
Games and Economic Behavior | 2019-03-29 | Paper |
Matroid Secretary Problems
Journal of the ACM | 2019-02-25 | Paper |
The growth of tri-colored sum-free sets
Discrete Analysis | 2019-01-09 | Paper |
Bandits with knapsacks
Journal of the ACM | 2018-12-06 | Paper |
Oblivious routing on node-capacitated and directed graphs
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Stability and auctions in labor markets with job security
Economics Letters | 2018-09-21 | Paper |
Job security, stability, and production efficiency
Theoretical Economics | 2018-09-19 | Paper |
Improving Christofides' algorithm for the \(s\)-\(t\) path TSP
Journal of the ACM | 2018-08-02 | Paper |
Exponential segregation in a two-dimensional Schelling model with tolerant individuals
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Simultaneous nearest neighbor search
(available as arXiv preprint) | 2018-01-30 | Paper |
On the complexity of computing an equilibrium in combinatorial auctions
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Bayesian incentive compatibility via matchings | 2017-09-29 | Paper |
Bernoulli factories and black-box reductions in mechanism design
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Beating \(1-\frac{1}{e}\) for ordered prophets
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication
(available as arXiv preprint) | 2017-03-22 | Paper |
| A nearly tight upper bound on tri-colored sum-free sets in characteristic 2 | 2016-05-26 | Paper |
Truthful mechanisms with implicit payment computation
Journal of the ACM | 2016-03-24 | Paper |
Polymatroid Prophet Inequalities
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Secretary Problems with Non-Uniform Arrival Order
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Bayesian incentive compatibility via matchings
Games and Economic Behavior | 2015-08-12 | Paper |
Approximately optimal auctions for correlated bidders
Games and Economic Behavior | 2015-08-12 | Paper |
Introduction to computer science and economic theory
Journal of Economic Theory | 2015-02-13 | Paper |
Pricing lotteries
Journal of Economic Theory | 2015-02-13 | Paper |
Multiplicative updates outperform generic no-regret learning in congestion games (extended abstract)
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Simple and near-optimal mechanisms for market intermediation
Web and Internet Economics | 2015-01-07 | Paper |
| Matroids, secretary problems, and online mechanisms | 2014-12-18 | Paper |
| Noisy binary search and its applications | 2014-12-18 | Paper |
| Semi-oblivious routing: lower bounds | 2014-12-18 | Paper |
| A multiple-choice secretary algorithm with applications to online auctions | 2014-10-13 | Paper |
| Online client-server load balancing without global information | 2014-10-13 | Paper |
| Isomorphism and embedding problems for infinite limits of scale-free graphs | 2014-10-13 | Paper |
| Oblivious routing on node-capacitated and directed graphs | 2014-10-13 | Paper |
Approximating low-dimensional coverage problems
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Which Networks are Least Susceptible to Cascading Failures?
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Lexicographic Products and the Power of Non-linear Network Coding
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Load balancing without regret in the bulletin board model
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Truthful germs are contagious: a local-to-global characterization of truthfulness
Games and Economic Behavior | 2014-06-19 | Paper |
Optimal auctions with correlated bidders are easy
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
| Inapproximability for VCG-based combinatorial auctions | 2014-05-22 | Paper |
| Pricing randomized allocations | 2014-05-22 | Paper |
| Sharp dichotomies for regret minimization in metric spaces | 2014-05-22 | Paper |
Matroid prophet inequalities
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
An analysis of one-dimensional Schelling segregation
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Improving Christofides' algorithm for the \(s\)-\(t\) path TSP
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
The \(K\)-armed dueling bandits problem
Journal of Computer and System Sciences | 2012-08-17 | Paper |
Load balancing without regret in the bulletin board model
Distributed Computing | 2012-02-06 | Paper |
Regret bounds for sleeping experts and bandits
Machine Learning | 2010-10-07 | Paper |
Approximation algorithms for the bottleneck asymmetric traveling salesman problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Improved lower bounds for the universal and a priori TSP
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
The serializability of network codes
Automata, Languages and Programming | 2010-09-07 | Paper |
Improved lower and upper bounds for universal TSP in planar metrics
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
New lower bounds for oblivious routing in undirected graphs
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Anytime algorithms for multi-armed bandit problems
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Consistent load balancing via spread minimization
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
(Almost) tight bounds and existence theorems for confluent flows
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Congestion games with malicious players
Games and Economic Behavior | 2009-08-27 | Paper |
Hat Guessing Games
SIAM Review | 2009-06-11 | Paper |
Hat Guessing Games
SIAM Journal on Discrete Mathematics | 2009-05-27 | Paper |
| A multiplicative deformation of the Möbius function for the poset of partitions of a multiset | 2009-04-14 | Paper |
A Knapsack Secretary Problem with Applications
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
| scientific article; zbMATH DE number 5485582 (Why is no real title available?) | 2009-01-05 | Paper |
On the capacity of information networks
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
Journal of the ACM | 2008-12-21 | Paper |
Competitive collaborative learning
Journal of Computer and System Sciences | 2008-12-12 | Paper |
Localized Client-Server Load Balancing without Global Information
SIAM Journal on Computing | 2008-08-14 | Paper |
Online linear optimization and adaptive routing
Journal of Computer and System Sciences | 2007-11-30 | Paper |
Fast matrix multiplication is stable
Numerische Mathematik | 2007-05-10 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2006-06-22 | Paper |
| Group-theoretic algorithms for matrix multiplication | 2005-11-17 | Paper |
Train tracks and zipping sequences for pseudo-Anosov braids
Chaos, Solitons and Fractals | 2000-07-24 | Paper |
