Complexity of Manipulating Elections with Few Candidates

Complexity of Mechanism Design

Complexity Results about Nash Equilibria

Composition Games for Distributed Systems: the EU Grant games

Computability of simple games: A characterization and application to the core

Computability of simple games: A complete investigation of the sixty-four possibilities

Computational Rationalization: The Inverse Equilibrium Problem

Computationally Feasible VCG Mechanisms

Computer Science and Game Theory: A Brief Survey

Computing Equilibria in Anonymous Games

Computing Good Nash Equilibria in Graphical Games

Computing Nash Equilibrium in Wireless Ad Hoc Networks: A Simulation-Based Approach

Computing Pure Nash Equilibria via Markov Random Fields

Computing the Equilibria of Bimatrix Games using Dominance Heuristics

Computing the nucleolus of weighted voting games

Computing voting power in easy weighted voting games

Concurrent Auctions Across The Supply Chain

Concurrent Imitation Dynamics in Congestion Games

Conducting Truthful Surveys, Cheaply

Congestion games with resource reuse and applications in spectrum sharing