The list of accepted papers to SODA 2011 has been published. Somewhat strangely the list published by SODA only mentions a subset of the authors for each paper, and in an arbitrary order (according to what’s in their system, apparantly).
AGT/E related ones:
- A Stackelberg Strategy for Routing Flow over Time by Lisa Fleischer, Elliot Anshelevich, and Umang Bhaskar
- A Subexponential Lower Bound for the Random Facet Algorithm for Parity Games by Thomas Dueholm Hansen, Uri Zwick and Oliver Friedmann
- Distributed Selfish Load Balancing on Networks by Martin Hoefer and Thomas Sauerwald
- Fast Convergence of Natural Bargaining Dynamics on Exchange
Networks by Yashodhan Kanoria - Local Smoothness and the Price of Anarchy in Atomic Splittable
Congestion Games by Florian Schoppmann and Tim Roughgarden - Matroid Secretary Problem in the Random Assignment Model by Jose Soto
- Mechanism Design via Correlation Gap by Qiqi Yan
- Near-Optimal No-Regret Algorithms for Zero-sum Games by Constantinos Daskalakis
- On Minmax Theorems for Multiplayer Games by Yang Cai and Constantinos Daskalakis
- On the Approximability of Budget Feasible Mechanisms by Pinyan Lu, Nick Gravin and Ning Chen
- On the Complexity of Approximating a Nash Equilibrium by Constantinos Daskalakis
- Online Stochastic Matching: Online Actions Based on Offline Statistics by Shayan Oveis Gharan and Vahideh Manshadi
- Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted
Allocations by Gagan Aggarwal, Gagan Goel, Chinmay Karande and Aranyak Mehta - Pricing on Paths: A PTAS for the Highway Problem by Thomas Rothvoss and Fabrizio Grandoni
- Risk-Averse Stochastic Optimization: Probabilistically-Constrained
Models and Algorithms for Black-Box Distributions by Chaitanya Swamy - Towards Optimal Bayesian Algorithmic Mechanism Design and Multi-
Parameter Bayesian Algorithmic Mechanism Design (merged papers) by Zhiyi Huang, Robert Kleinberg and Jason Hartline - Welfare Guarantees for Combinatorial Auctions with Item Bidding by Tim Roughgarden and Kshipra Bhawalkar
Turing's Invisible Hand 
One more paper qualifies I think.
Secretary Problems: Laminar Matroid and Interval Scheduling
S. Im, Y. Wang