We examine many issues in the interface between game theory and algorithms and computation. In such domains, selfish agents interact, and each attempts to maximize its own profit. Such models have applications in many domains, such as electronic commerce, auctions, task and resource allocation and many more. Some of the models we consider are cooperative, where agents need each other to achieve their goals, and some are competitive. We investigate computational aspects of such domains, such as finding the optimal strategy, computing and testing for equilibrium, and designing stable and fair contracts. Example projects include the following.

Research Areas

• Collusion in auctions of various kinds
• Game theoretic models for security
• Coalition formation
• Fair contracts for cooperation
• Computing stable payoff allocations
• External subsidies for achieving cooperation, and the Cost of Stability