 | 2009 |
|---|
| 11 |       | Constantinos Daskalakis,
Grant Schoenebeck,
Gregory Valiant,
Paul Valiant:
On the complexity of Nash equilibria of action-graph games.
SODA 2009: 710-719 |
| 10 | | Arnab Bhattacharyya,
Swastik Kopparty,
Grant Schoenebeck,
Madhu Sudan,
David Zuckerman:
Optimal Testing of Reed-Muller Codes
CoRR abs/0910.0641: (2009) |
| 2008 |
|---|
| 9 | | Grant Schoenebeck:
Linear Level Lasserre Lower Bounds for Certain k-CSPs.
FOCS 2008: 593-602 |
| 8 | | Constantinos Daskalakis,
Grant Schoenebeck,
Gregory Valiant,
Paul Valiant:
On the Complexity of Nash Equilibria of Action-Graph Games
CoRR abs/0802.1604: (2008) |
| 2007 |
|---|
| 7 | | Grant Schoenebeck,
Luca Trevisan,
Madhur Tulsiani:
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover.
IEEE Conference on Computational Complexity 2007: 205-216 |
| 6 | | Grant Schoenebeck,
Luca Trevisan,
Madhur Tulsiani:
Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut.
STOC 2007: 302-310 |
| 2006 |
|---|
| 5 | | Grant Schoenebeck,
Salil P. Vadhan:
The computational complexity of nash equilibria in concisely represented games.
ACM Conference on Electronic Commerce 2006: 270-279 |
| 4 | | Grant Schoenebeck,
Luca Trevisan,
Madhur Tulsiani:
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover.
Electronic Colloquium on Computational Complexity (ECCC) 13(098): (2006) |
| 3 | | Grant Schoenebeck,
Luca Trevisan,
Madhur Tulsiani:
Tight Integrality Gaps for Lovasz-Schrijver LP Relaxations of Vertex Cover and Max Cut.
Electronic Colloquium on Computational Complexity (ECCC) 13(132): (2006) |
| 2005 |
|---|
| 2 | | Grant Schoenebeck,
Salil P. Vadhan:
The Computational Complexity of Nash Equilibria in Concisely Represented Games
Electronic Colloquium on Computational Complexity (ECCC)(052): (2005) |
| 2004 |
|---|
| 1 |  | David C. Parkes,
Grant Schoenebeck:
GROWRANGE: Anytime VCG-Based Mechanisms.
AAAI 2004: 34-41 |
