| Publication | Date of Publication | Type |
|---|
| Non-stochastic CDF estimation using threshold queries | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147377 | 2024-01-15 | Paper |
| Optimal oblivious reconfigurable networks | 2023-12-08 | Paper |
| Revenue monotonicity under misspecified bidders | 2023-03-21 | Paper |
| Bernoulli Factories and Black-box Reductions in Mechanism Design | 2022-12-08 | Paper |
| Threshold tests as quality signals: optimal strategies, equilibria, and Price of anarchy | 2022-07-06 | Paper |
| Optimal stopping with behaviorally biased agents: the role of loss aversion and changing reference points | 2022-06-09 | Paper |
| Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem | 2022-02-22 | Paper |
| A diameter-revealing proof of the Bondy-Lovász lemma | 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 | 2021-05-11 | Paper |
| Bandits and Experts in Metric Spaces | 2020-02-11 | Paper |
| Prior independent mechanisms via prophet inequalities with limited information | 2019-12-12 | Paper |
| The Lovász theta function for random regular graphs and community detection in the hard regime | 2019-09-02 | Paper |
| Prophet Inequalities with Limited Information | 2019-06-20 | Paper |
| Orienteering for electioneering | 2019-06-11 | Paper |
| Sketching valuation functions | 2019-05-10 | Paper |
| Matroid prophet inequalities and applications to multi-dimensional mechanism design | 2019-03-29 | Paper |
| Matroid Secretary Problems | 2019-02-25 | Paper |
| The growth of tri-colored sum-free sets | 2019-01-09 | Paper |
| Bandits with knapsacks | 2018-12-06 | Paper |
| Oblivious routing on node-capacitated and directed graphs | 2018-11-05 | Paper |
| Stability and auctions in labor markets with job security | 2018-09-21 | Paper |
| Job security, stability, and production efficiency | 2018-09-19 | Paper |
| Improving Christofides' algorithm for the \(s\)-\(t\) path TSP | 2018-08-02 | Paper |
| Exponential segregation in a two-dimensional Schelling model with tolerant individuals | 2018-07-16 | Paper |
| Simultaneous nearest neighbor search | 2018-01-30 | Paper |
| On the complexity of computing an equilibrium in combinatorial auctions | 2017-10-05 | Paper |
| Bayesian incentive compatibility via matchings | 2017-09-29 | Paper |
| Bernoulli factories and black-box reductions in mechanism design | 2017-08-17 | Paper |
| Beating \(1-\frac{1}{e}\) for ordered prophets | 2017-08-17 | Paper |
| Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate | 2017-06-08 | Paper |
| Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication | 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 | 2016-03-24 | Paper |
| Polymatroid Prophet Inequalities | 2015-11-19 | Paper |
| Secretary Problems with Non-Uniform Arrival Order | 2015-08-21 | Paper |
| Bayesian incentive compatibility via matchings | 2015-08-12 | Paper |
| Approximately optimal auctions for correlated bidders | 2015-08-12 | Paper |
| Introduction to computer science and economic theory | 2015-02-13 | Paper |
| Pricing lotteries | 2015-02-13 | Paper |
| Multiplicative updates outperform generic no-regret learning in congestion games (extended abstract) | 2015-02-04 | Paper |
| Simple and near-optimal mechanisms for market intermediation | 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 | 2014-08-07 | Paper |
| Which Networks are Least Susceptible to Cascading Failures? | 2014-07-30 | Paper |
| Lexicographic Products and the Power of Non-linear Network Coding | 2014-07-30 | Paper |
| Load balancing without regret in the bulletin board model | 2014-07-23 | Paper |
| Truthful germs are contagious: a local-to-global characterization of truthfulness | 2014-06-19 | Paper |
| Optimal auctions with correlated bidders are easy | 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 | 2014-05-13 | Paper |
| An analysis of one-dimensional Schelling segregation | 2014-05-13 | Paper |
| Improving Christofides' algorithm for the \(s\)-\(t\) path TSP | 2014-05-13 | Paper |
| The \(K\)-armed dueling bandits problem | 2012-08-17 | Paper |
| Load balancing without regret in the bulletin board model | 2012-02-06 | Paper |
| Regret bounds for sleeping experts and bandits | 2010-10-07 | Paper |
| Approximation algorithms for the bottleneck asymmetric traveling salesman problem | 2010-09-10 | Paper |
| Improved lower bounds for the universal and a priori TSP | 2010-09-10 | Paper |
| The serializability of network codes | 2010-09-07 | Paper |
| Improved lower and upper bounds for universal TSP in planar metrics | 2010-08-16 | Paper |
| New lower bounds for oblivious routing in undirected graphs | 2010-08-16 | Paper |
| Anytime algorithms for multi-armed bandit problems | 2010-08-16 | Paper |
| Consistent load balancing via spread minimization | 2010-08-16 | Paper |
| Adaptive routing with end-to-end feedback: distributed learning and geometric approaches | 2010-08-15 | Paper |
| (Almost) tight bounds and existence theorems for confluent flows | 2010-08-15 | Paper |
| Congestion games with malicious players | 2009-08-27 | Paper |
| Hat Guessing Games | 2009-06-11 | Paper |
| Hat Guessing Games | 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 | 2009-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302093 | 2009-01-05 | Paper |
| On the capacity of information networks | 2008-12-21 | Paper |
| (Almost) Tight bounds and existence theorems for single-commodity confluent flows | 2008-12-21 | Paper |
| Competitive collaborative learning | 2008-12-12 | Paper |
| Localized Client-Server Load Balancing without Global Information | 2008-08-14 | Paper |
| Online linear optimization and adaptive routing | 2007-11-30 | Paper |
| Fast matrix multiplication is stable | 2007-05-10 | Paper |
| Learning Theory | 2006-06-22 | Paper |
| Group-theoretic algorithms for matrix multiplication | 2005-11-17 | Paper |
| Train tracks and zipping sequences for pseudo-Anosov braids | 2000-07-24 | Paper |
