The Computational Complexity of Nash Equilibria in Concisely Represented Games
Grant Schoenebeck (UC Berkeley), Salil Vadhan (Harvard University)

Nash Equilibria in Graphical Games on Trees Revisited
Edith Elkind (University of Warwick), Leslie Ann Goldberg (University of Warwick), Paul Goldberg (University of Warwick)

Computing Pure Nash Equilibria in Graphical Games via Markov Random Fields
Constantinos Daskalakis (UC Berkeley), Christos Papadimitriou (UC Berkeley)

Networks Preserving Evolutionary Equilibria and the Power of Randomization
Michael Kearns (University of Pennsylvania), Siddharth Suri (University of Pennsylvania)

Playing Games in Many Possible Worlds
Seth Gilbert (MIT), April Rasala Lehman (Google), Matt Lepinski (MIT), David Liben-Nowell (Carleton College)

Learning From Revealed Preference
Eyal Beigman (Northwestern University), Rakesh Vohra (Northwestern University)

An Analysis of Alternative Slot Auction Designs for Sponsored Search
Sebastien Lahaie (Harvard University)

Multi-unit Auctions with Unknown Supply
Mohammad Mahdian (Microsoft Research), Amin Saberi (Stanford University)

Truthful Auctions for Pricing Search Keywords
Gagan Aggarwal (Google), Ashish Goel (Stanford University), Rajeev Motwani (Stanford University)

An Adaptive Algorithm for Selecting Profitable Keywords for Search-Based Advertising Services
Paat Rusmevichientong (Cornell University), David Williamson (Cornell University)

Braess's Paradox in Large Random Graphs
Gregory Valiant (Harvard University), Tim Roughgarden (Stanford University)

Welfare Maximization in Congestion Games
Liad Blumrosen (Hebrew University), Shahar Dobzinski (Hebrew University)

Incentive-Compatible Inter-Domain Routing
Joan Feigenbaum (Yale University), Vijay Ramachandran (ICSI), Michael Schapira (Hebrew University)

Non-Cooperative Multicast and Facility Location Games
Chandra Chekuri (Bell Labs, Lucent Technologies), Julia Chuzhoy (MIT), Liane Lewin-Eytan (Technion), Joseph (Seffi) Naor (Microsoft Corporation), Ariel Orda (Technion)

A Sufficient Condition for Truthfulness with Single Parameter Agents
Nir Andelman (Tel-Aviv University), Yishay Mansour (Tel-Aviv University)

Implementation with a Bounded Action Space
Liad Blumrosen (Hebrew University), Michal Feldman (Hebrew University)

Multi-Attribute Coalitional Games
Samuel Ieong (Stanford University), Yoav Shoham (Stanford University)

Combinatorial Agency
Moshe Babaioff (UC Berkeley), Michal Feldman (Hebrew University), Noam Nisan (Hebrew University)

Computing the Optimal Strategy to Commit to
Vincent Conitzer (Carnegie Mellon University), Tuomas Sandholm (Carnegie Mellon University)

Finding Equilibria in Large Sequential Games of Imperfect Information
Andrew Gilpin (Carnegie Mellon University), Tuomas Sandholm (Carnegie Mellon University)

A Privacy-preserving Collaborative Filtering Scheme with Two-way Communication
Sheng Zhang (Dartmouth College), James Ford (Dartmouth College), Fillia Makedon (Dartmouth College)

Minimum Payments that Reward Honest Reputation Feedback
Radu Jurca (EPFL), Boi Faltings (EPFL)

Efficiency and Nash Equilibria in a Scrip System for P2P Networks
Eric Friedman (Cornell University), Joseph Halpern (Cornell University), Ian Kash (Cornell University)

Incentives Engineering for Structured P2P Systems -- A Feasibility Demonstration Using Economic Experiments
Stephan Schosser (Universität Karlsruhe), Klemens Böhm (Universität Karlsruhe), Rainer Schmidt (Otto-von-Guericke-University Magdeburg), Bodo Vogt (Otto-von-Guericke-University Magdeburg)

Controlling a Supply Chain Agent Using Value-Based Decomposition
Christopher Kiekintveld (University of Michigan), Jason Miller (University of Michigan), Patrick Jordan (University of Michigan), Michael Wellman (University of Michigan)

Empirical Mechanism Design: Methods, with Application to a Supply-Chain Scenario
Yevgeniy Vorobeychik (University of Michigan), Christopher Kiekintveld (University of Michigan), Michael Wellman (University of Michigan)

(In)Stability Properties of Limit Order Dynamics
Eyal Even-Dar (University of Pennsylvania), Sham Kakade (TTI Chicago), Michael Kearns (University of Pennsylvania), Yishay Mansour (Tel-Aviv University)

B2C E-Commerce Development in Africa: Case Study of Botswana
Faith-Michael Uzoka (University of Calgary), Geoffery Seleka (University of Botswana)

Optimal Pricing with Recommender Systems
Dirk Bergemann (Yale University), Deran Ozmen (Boston Consulting)

Can Online Reviews Reveal a Product’s True Quality? Empirical Findings and Analytical Modeling of Online Word-of-Mouth Communication
Jennifer Zhang (University of Toledo), Nan Hu (Singapore Management University), Paul Pavlou (University of California - Riverside)

Scouts, Promoters, and Connectors: The Roles of Ratings in Nearest Neighbor Collaborative Filtering
Bharath Kumar Mohan (Indian Institute of Science), Benjamin Keller (Eastern Michigan University), Naren Ramakrishnan (Virginia Tech)

The Dynamics of Viral Marketing
Jurij Leskovec (Carnegie Mellon University), Lada Adamic (University of Michigan), Bernardo Huberman (Hewlett Packard Labs)

Random Popular Matchings
Mohammad Mahdian (Microsoft Research)

Bid Expressiveness and Clearing Algorithms in Multiattribute Double Auctions
Yagil Engel (University of Michigan), Michael Wellman (University of Michigan), Kevin Lochner (University of Michigan)

The Sequential Auction Problem on eBay: An Empirical Analysis and a Solution
Adam Juda (Harvard University), David Parkes (Harvard University)

Approximation Algorithms and Online Mechanisms for Item Pricing
Maria-Florina Balcan (Carnegie Mellon University), Avrim Blum (Carnegie Mellon University)