Related papers: A process algebraic form to represent extensive ga…

We prove that finding an epsilon-Nash equilibrium in a succinctly representable game with many players is PPAD-hard for constant epsilon. Our proof uses succinct games, i.e. games whose payoff function is represented by a circuit. Our…

Exploiting the algebraic structure of the set of bimatrix games, a divide-and-conquer algorithm for finding Nash equilibria is proposed. The algorithm is fixed-parameter tractable with the size of the largest irreducible component of a game…

Multi-agent complex systems comprising populations of decision-making particles, have many potential applications across the biological, informational and social sciences. We show that the time-averaged dynamics in such systems bear a…

In this paper, we develop a Mean Field Games approach to Cluster Analysis. We consider a finite mixture model, given by a convex combination of probability density functions, to describe the given data set. We interpret a data point as an…

The game theory techniques are used to find the equilibrium of a market. Game theory refers to the ways in which strategic interactions among economic agents produce outcomes with respect to the preferences (or utilities) of those agents,…

The computational characterization of game-theoretic solution concepts is a central topic in artificial intelligence, with the aim of developing computationally efficient tools for finding optimal ways to behave in strategic interactions.…

In the game theory literature, there appears to be little research on equilibrium selection for normal-form games with an infinite strategy space and discontinuous utility functions. Moreover, many existing selection methods are not…

We revisit the coalition structure generation problem in which the goal is to partition the players into exhaustive and disjoint coalitions so as to maximize the social welfare. One of our key results is a general polynomial-time algorithm…

Negotiations, a model of concurrency with multi party negotiation as primitive, have been recently introduced by J. Desel and J. Esparza. We initiate the study of games for this model. We study coalition problems: can a given coalition of…

We define solution concepts appropriate for computationally bounded players playing a fixed finite game. To do so, we need to define what it means for a \emph{computational game}, which is a sequence of games that get larger in some…

We present a consistent formulation of quantum game theory that accommodates all possible strategies in Hilbert space. The physical content of the quantum strategy is revealed as a family of classical games representing altruistic game play…

Important decisions are likely made by groups of agents. Thus group decision making is very common in practice. Very transparent group aggregating rules are given by weighted voting, where each agent is assigned a weight. Here a proposal is…

We study bargaining games between suppliers and manufacturers in a network context. Agents wish to enter into contracts in order to generate surplus which then must be divided among the participants. Potential contracts and their surplus…

Equilibria of realistic multiplayer games constitute a key solution concept both in practical applications, such as online advertising auctions and electricity markets, and in analytical frameworks used to study strategic voting in…

Rating strategies in a game is an important area of research in game theory and artificial intelligence, and can be applied to any real-world competitive or cooperative setting. Traditionally, only transitive dependencies between strategies…

This paper presents a monoidal category whose morphisms are games (in the sense of game theory, not game semantics) and an associated diagrammatic language. The two basic operations of a monoidal category, namely categorical composition and…

Causal games are probabilistic graphical models that enable causal queries to be answered in multi-agent settings. They extend causal Bayesian networks by specifying decision and utility variables to represent the agents' degrees of freedom…

Multi-agent games in dynamic nonlinear settings are challenging due to the time-varying interactions among the agents and the non-stationarity of the (potential) Nash equilibria. In this paper we consider model-free games, where agent…

We propose a new approach to mean field games with major and minor players. Our formulation involves a two player game where the optimization of the representative minor player is standard while the major player faces an optimization over…

Game theory's prescriptive power typically relies on full rationality and/or self-play interactions. In contrast, this work sets aside these fundamental premises and focuses instead on heterogeneous autonomous interactions between two or…