We prove that finding an ε-approximate Nash equilibrium is PPAD-complete for constant ε
and a particularly simple class of games: polymatrix, degree 3 graphical games, in which …

Finding an equilibrium of an extensive form game of imperfect information is a fundamental
problem in computational game theory, but current techniques do not scale to large games …

In adversarial multiagent domains, security, commonly defined as the ability to deal with
intentional threats from other agents, is a critical issue. This paper focuses on domains …

Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute an
expressive framework for multiagent planning under uncertainty, but solving them is …

As large-scale theft of data from corporate servers is becoming increasingly common, it
becomes interesting to examine alternatives to the paradigm of centralizing sensitive data …

In the real world, noisy sensors and limited communication make it difficult for robot teams to
coordinate in tightly coupled tasks. Team members cannot simply apply single-robot solution …

We extend the well-known fictitious play (FP) algorithm to compute pure-strategy Bayesian-
Nash equilibria in private-value games of incomplete information with finite actions and …

If a network is to operate successfully, its users need to collaborate. Collaboration takes the
form of following a network protocol and involves some resource expenditure on the part of …

We describe an algorithm for computing best response strategies in a class of two-player
infinite games of incomplete information, defined by payoffs piecewise linear in agents' types …

This paper analyzes bilateral multi-issue negotiation between self-interested autonomous
agents. The agents have time constraints in the form of both deadlines and discount factors …