The following pages link to Constantinos Daskalakis (Q458481):
Displaying 50 items.
- Nash equilibria: complexity, symmetries, and approximation (Q458482) (← links)
- Sparse covers for sums of indicators (Q495555) (← links)
- Connectivity and equilibrium in random games (Q549865) (← links)
- Global alignment of molecular sequences via ancestral state reconstruction (Q713206) (← links)
- Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture (Q718865) (← links)
- A note on approximate Nash equilibria (Q1014628) (← links)
- Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis (Q1948701) (← links)
- Learning in auctions: regret is hard, envy is easy (Q2155904) (← links)
- Approximate Nash equilibria in anonymous games (Q2253838) (← links)
- Learning Poisson binomial distributions (Q2345953) (← links)
- Extreme value theorems for optimal multidimensional pricing (Q2516245) (← links)
- Near-optimal no-regret algorithms for zero-sum games (Q2516247) (← links)
- Zero-Sum Polymatrix Games: A Generalization of Minmax (Q2806824) (← links)
- How Good is the Chord Algorithm? (Q2816293) (← links)
- The complexity of computing a Nash equilibrium (Q2931371) (← links)
- Optimal phylogenetic reconstruction (Q2931380) (← links)
- On the Complexity of Approximating a Nash Equilibrium (Q2933653) (← links)
- Probabilistic Analysis of Linear Programming Decoding (Q2934618) (← links)
- Message-Passing Algorithms and Improved LP Decoding (Q2989683) (← links)
- Sorting and Selection in Posets (Q3093615) (← links)
- Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep (Q3094948) (← links)
- Simple, Optimal and Efficient Auctions (Q3102584) (← links)
- On Learning Algorithms for Nash Equilibria (Q3162512) (← links)
- Computing Equilibria in Large Games We Play (Q3507429) (← links)
- The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games (Q3613786) (← links)
- A Note on Strictly Competitive Games (Q3651214) (← links)
- Species Trees from Gene Trees Despite a High Rate of Lateral Genetic Transfer: A Tight Bound (Extended Abstract) (Q4575694) (← links)
- The Complexity of Hex and the Jordan Curve Theorem (Q4598160) (← links)
- Testing Ising Models (Q4608021) (← links)
- Strong Duality for a Multiple-Good Monopolist (Q4614956) (← links)
- (Q4633848) (← links)
- (Q4633883) (← links)
- (Q5090401) (← links)
- Optimal Stopping Rules for Sequential Hypothesis Testing (Q5111719) (← links)
- EQUILIBRIA, FIXED POINTS, AND COMPUTATIONAL COMPLEXITY - NEVANLINNA PRIZE LECTURE (Q5121980) (← links)
- Message passing algorithms and improved LP decoding (Q5172692) (← links)
- On oblivious PTAS's for nash equilibrium (Q5172700) (← links)
- The Complexity of Computing a Nash Equilibrium (Q5189544) (← links)
- Testing Ising Models (Q5211480) (← links)
- Regression from dependent observations (Q5212828) (← links)
- A converse to Banach's fixed point theorem and its CLS-completeness (Q5230275) (← links)
- On a Network Generalization of the Minmax Theorem (Q5321674) (← links)
- A size-free CLT for poisson multinomials and its applications (Q5361903) (← links)
- Bayesian Truthful <i>Mechanisms</i> for Job Scheduling from Bi-criterion Approximation <i>Algorithms</i> (Q5363020) (← links)
- Testing Poisson Binomial Distributions (Q5363067) (← links)
- (Q5365039) (← links)
- (Q5365040) (← links)
- (Q5365081) (← links)
- (Q5365135) (← links)
- A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage (Q5384009) (← links)
