| 2011 |
|---|
| 21 | Best-response auctions. Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar. ACM Conference on Electronic Commerce 2011, 351-360. Web SearchBibTeXDownload |
| 20 | Testing $k$-Modal Distributions: Optimal Algorithms via Reductions. Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio, Gregory Valiant, Paul Valiant. CoRR (abs/1112.5659) (2011). Web SearchBibTeXDownload |
| 19 | The Power of Linear Estimators. Gregory Valiant, Paul Valiant. FOCS 2011, 403-412. Web SearchBibTeXDownload |
| 18 | Best-Response Mechanisms. Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar. ICS 2011, 155-165. Web SearchBibTeXDownload |
| 17 | Incentive-compatible distributed greedy protocols. Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar. PODC 2011, 335-336. Web SearchBibTeXDownload |
| 16 | When is it best to best-respond?. Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar. SIGecom Exchanges (10): 16-18 (2011). Web SearchBibTeXDownload |
| 15 | Estimating the unseen: an n/log(n)-sample estimator for entropy and support size, shown optimal via new CLTs. Gregory Valiant, Paul Valiant. STOC 2011, 685-694. Web SearchBibTeXDownload |
| 2010 |
|---|
| 14 | Settling the Polynomial Learnability of Mixtures of Gaussians. Ankur Moitra, Gregory Valiant. CoRR (abs/1004.4223) (2010). Web SearchBibTeXDownload |
| 13 | A CLT and tight lower bounds for estimating entropy. Gregory Valiant, Paul Valiant. Electronic Colloquium on Computational Complexity (ECCC) (17): 183 (2010). Web SearchBibTeXDownload |
| 12 | Estimating the unseen: A sublinear-sample canonical estimator of distributions. Gregory Valiant, Paul Valiant. Electronic Colloquium on Computational Complexity (ECCC) (17): 184 (2010). Web SearchBibTeXDownload |
| 11 | A New Look at Selfish Routing. Christos H. Papadimitriou, Gregory Valiant. ICS 2010, 178-187. Web SearchBibTeXDownload |
| 10 | Braess's Paradox in large random graphs. Gregory Valiant, Tim Roughgarden. Random Struct. Algorithms (37): 495-515 (2010). Web SearchBibTeXDownload |
| 9 | On Learning Algorithms for Nash Equilibria. Constantinos Daskalakis, Rafael Frongillo, Christos H. Papadimitriou, George Pierrakos, Gregory Valiant. SAGT 2010, 114-125. Web SearchBibTeXDownload |
| 8 | Designing Network Protocols for Good Equilibria. Ho-Lin Chen, Tim Roughgarden, Gregory Valiant. SIAM J. Comput. (39): 1799-1832 (2010). Web SearchBibTeXDownload |
| 7 | Efficiently learning mixtures of two Gaussians. Adam Tauman Kalai, Ankur Moitra, Gregory Valiant. STOC 2010, 553-562. Web SearchBibTeXDownload |
| 2009 |
|---|
| 6 | Size Bounds for Conjunctive Queries with General Functional Dependencies. Gregory Valiant, Paul Valiant. CoRR (abs/0909.2030) (2009). Web SearchBibTeXDownload |
| 5 | Size and treewidth bounds for conjunctive queries. Georg Gottlob, Stephanie Tien Lee, Gregory Valiant. PODS 2009, 45-54. Web SearchBibTeXDownload |
| 4 | On the complexity of Nash equilibria of action-graph games. Constantinos Daskalakis, Grant Schoenebeck, Gregory Valiant, Paul Valiant. SODA 2009, 710-719. Web SearchBibTeXDownload |
| 2008 |
|---|
| 3 | On the Complexity of Nash Equilibria of Action-Graph Games. Constantinos Daskalakis, Grant Schoenebeck, Gregory Valiant, Paul Valiant. CoRR (abs/0802.1604) (2008). Web SearchBibTeXDownload |
| 2 | Designing networks with good equilibria. Ho-Lin Chen, Tim Roughgarden, Gregory Valiant. SODA 2008, 854-863. Web SearchBibTeXDownload |
| 2006 |
|---|
| 1 | Braess's paradox in large random graphs. Gregory Valiant, Tim Roughgarden. ACM Conference on Electronic Commerce 2006, 296-305. Web SearchBibTeXDownload |
