Grant Schoenebeck

PhD candidate in theoretical computer science at University of California, Berkeley.

Research Interests:

Complexity theory, intersection of economics and computer science.

Personal:

I was born in Green Bay, WI and moved to Wichita, KS when I was nine. I attended Harvard University and majored in mathematics. After graduating, I attended Oxford University as the von Clemm fellow and studied theology. I am currently studying theoretical computer science at UC Berkeley and being advised by Luca Trevisan.

Papers:

G. Schoenebeck
Linear Level Lasserre Lower Bounds for Certain k-CSPs
To appear FOCS '08.

C. Daskalakis, G. Schoenebeck, G. Valiant, P. Valiant
On the Complexity of Nash Equilibria of Action-Graph Games.
ArXiv '08.

G. Schoenebeck, L. Trevisan, M. Tulsiani.
Tight Integrality Gaps for Lovasz-Schrijver LP Relaxations of Vertex Cover and Max Cut.
ECCC '06. STOC '07.

G. Schoenebeck, L. Trevisan, M. Tulsiani.
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover.
ECCC '06. CCC '07.

G. Schoenebeck, S. Vadhan.
The computational Complexity of Concisely Represented Games.
ECCC '05. ACM EC '06.

H. Gylfason, O. Khan, G. Schoenebeck.
Chora: Expert-based Peer-to-peer web search.
AP2PC workshop at AAMAS '06.

D. Parkes, G. Schoenebeck.
GrowRange: Anytime VCG-Based Mechanisms..
AAAI '04.

Other Links:

Complexity Theory Reading Group

Contact Information:

Email:

Office Phone: 510-642-5422