Related papers: Graphical Potential Games
We introduce a framework for stochastic games on large sparse graphs, covering continuous-time and discrete-time dynamic games as well as static games. Players are indexed by the vertices of simple, locally finite graphs, allowing both…
Game theory provides a general mathematical background to study the effect of pair interactions and evolutionary rules on the macroscopic behavior of multi-player games where players with a finite number of strategies may represent a wide…
This compendium features advances in Game Theory, to include: Classical Game Theory: Cooperative and non-cooperative. Zero-sum and non-zero sum games. Potential and Congestion games. Mean Field games. Nash Equilibrium, Correlated Nash…
This paper generalizes L.S. Shapley's celebrated value allocation theory on coalition games by discovering and applying a fundamental connection between stochastic path integration driven by canonical time-reversible Markov chains and…
Games with incomplete preferences are an important model for studying rational decision-making in scenarios where players face incomplete information about their preferences and must contend with incomparable outcomes. We study the problem…
Freight forwarding plays a crucial role in facilitating global trade and logistics. However, as the freight forwarding market is extremely fragmented, freight forwarders often face the issue of not being able to fill the available shipping…
One of the long-debated issues in coalitional game theory is how to extend the Shapley value to games with externalities (partition-function games). When externalities are present, not only can a player's marginal contribution - a central…
Graphon games are a class of games with a continuum of agents, introduced to approximate the strategic interactions in large network games. The first result of this study is an equilibrium existence theorem in graphon games, under the same…
We study strategic games on weighted directed graphs, in which the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy, augmented by a fixed non-negative integer bonus for picking a…
In interactive multi-agent settings, decision-making and planning are challenging mainly due to the agents' interconnected objectives. Dynamic game theory offers a formal framework for analyzing such intricacies. Yet, solving constrained…
The recently defined class of integer programming games (IPG) models situations where multiple self-interested decision makers interact, with their strategy sets represented by a finite set of linear constraints together with integer…
In this dissertation, we analyze the computational properties of game-theoretic centrality measures. The key idea behind game-theoretic approach to network analysis is to treat nodes as players in a cooperative game, where the value of each…
A recurring theme in recent computer science literature is that proper design of signaling schemes is a crucial aspect of effective mechanisms aiming to optimize social welfare or revenue. One of the research endeavors of this line of work…
This study introduces the \emph{edge-based Shapley value}, a novel allocation rule within cooperative game theory, specifically tailored for networked systems, where value is generated through interactions represented by edges. Traditional…
Noncooperative games with uncertain payoffs have been classically studied under the expected-utility theory framework, which relies on the strong assumption that agents behave rationally. However, simple experiments on human decision makers…
Lloyd Shapley's cooperative value allocation theory stands as a central concept in game theory, extensively utilized across various domains to distribute resources, evaluate individual contributions, and ensure fairness. The Shapley value…
We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding…
We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding…
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…
Global games are a class of incomplete information games where the payoffs exhibit strategic complementarity leading to an incentive for the agents to coordinate their actions. Such games have been used to model scenarios in many…