Related papers: On Existence of Equilibrium Under Social Coalition…
Prediction is a well-studied machine learning task, and prediction algorithms are core ingredients in online products and services. Despite their centrality in the competition between online companies who offer prediction-based products,…
We study the robust Nash equilibrium (RNE) for a class of games in communications systems and networks where the impact of users on each other is an additive function of their strategies. Each user measures this impact, which may be…
This paper develops a game-theoretic model and an agent-based model to study group formation driven by resource pooling, spatial cohesion, and heterogeneity. We focus on cross-sector partnerships (CSPs) involving public, private, and…
We provide an in-depth study of Nash equilibria in multi-objective normal form games (MONFGs), i.e., normal form games with vectorial payoffs. Taking a utility-based approach, we assume that each player's utility can be modelled with a…
Cooperative game theory deals with systems where players want to cooperate to improve their payoffs. But players may choose coalitions in a non-cooperative manner, leading to a coalition-formation game. We consider such a game with several…
Coalition formation is concerned with the question of how to partition a set of agents into disjoint coalitions according to their preferences. Deviating from most of the previous work, we consider an online variant of the problem, where…
In this work, we provide a structural characterization of the possible Nash equilibria in the well-studied class of security games with additive utility. Our analysis yields a classification of possible equilibria into seven types and we…
Secure equilibrium is a refinement of Nash equilibrium, which provides some security to the players against deviations when a player changes his strategy to another best response strategy. The concept of secure equilibrium is specifically…
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing optimal strategies and the values of competitive games…
Despite many distributed resource allocation (DRA) algorithms have been reported in literature, it is still unknown how to allocate the resource optimally over multiple interacting coalitions. One major challenge in solving such a problem…
We discuss similarities and differences between systems of interacting players maximizing their individual payoffs and particles minimizing their interaction energy. Long-run behavior of stochastic dynamics of spatial games with multiple…
In finite games mixed Nash equilibria always exist, but pure equilibria may fail to exist. To assess the relevance of this nonexistence, we consider games where the payoffs are drawn at random. In particular, we focus on games where a large…
We provide a unified variational inequality framework for the study of fundamental properties of the Nash equilibrium in network games. We identify several conditions on the underlying network (in terms of spectral norm, infinity norm and…
We introduce set packing games as an abstraction of situations in which $n$ selfish players select subsets of a finite set of indivisible items, and analyze the quality of several equilibria for this class of games. Assuming that players…
The Nash Equilibrium is a much discussed, deceptively complex, method for the analysis of non-cooperative games. If one reads many of the commonly available definitions the description of the Nash Equilibrium is deceptively simple in…
Mean field games (MFG) are dynamic games with infinitely many infinitesimal agents. In this context, we study the efficiency of Nash MFG equilibria: Namely, we compare the social cost of a MFG equilibrium with the minimal cost a global…
Within the context of games on networks S. Goyal (Goya (2007), pg. 39) posed the following problem. Under any arbitrary but fixed topology, does there exist at least one pure Nash equilibrium that exhibits a positive relation between the…
We analyse the computational complexity of finding Nash equilibria in turn-based stochastic multiplayer games with omega-regular objectives. We show that restricting the search space to equilibria whose payoffs fall into a certain interval…
Nash equilibrium is one of the most influential solution concepts in game theory. With the development of computer science and artificial intelligence, there is an increasing demand on Nash equilibrium computation, especially for Internet…
In game theory, mechanism design is concerned with the design of incentives so that a desired outcome of the game can be achieved. In this paper, we study the design of incentives so that a desirable equilibrium is obtained, for instance,…