Related papers: Quantitative Games under Failures
We give a concise and self-contained introduction to the theory of Quantum Games by reviewing the seminal works of Meyer, Eisert-Wilkens-Lewenstein, Marinatto-Weber and Landsburg, which initiated the study of this field. By generalizing…
We propose a model for games in which the players have shared access to a blockchain that allows them to deploy smart contracts to act on their behalf. This changes fundamental game-theoretic assumptions about rationality since a contract…
We consider concurrent games played by two-players on a finite-state graph, where in every round the players simultaneously choose a move, and the current state along with the joint moves determine the successor state. We study a…
The game in which acts of participants don't have an adequate description in terms of Boolean logic and classical theory of probabilities is considered. The model of the game interaction is constructed on the basis of a non-distributive…
We propose a model of discrete time dynamic congestion games with atomic players and a single source-destination pair. The latencies of edges are composed by free-flow transit times and possible queuing time due to capacity constraints. We…
In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives. To this end, we introduce the notion of requirement, and the…
In the game-theoretic model war of attrition, players are subject to an explicit cost proportional to the duration of contests. We construct a model where the time cost is not explicitly given, but instead depends implicitly on the…
Traditional solvable game theory and mean-field-type game theory (risk-aware games) predominantly focus on quadratic costs due to their analytical tractability. Nevertheless, they often fail to capture critical non-linearities inherent in…
We investigate the interrelation between graph searching games and games with imperfect information. As key consequence we obtain that parity games with bounded imperfect information can be solved in PTIME on graphs of bounded DAG-width…
Bayesian networks and their accompanying graphical models are widely used for prediction and analysis across many disciplines. We will reformulate these in terms of linear maps. This reformulation will suggest a natural extension, which we…
This paper investigates the application of game-theoretic principles combined with advanced Kalman filtering techniques to enhance maritime target tracking systems. Specifically, the paper presents a two-player, imperfect information,…
Many-body dynamical models in which Boltzmann statistics can be derived directly from the underlying dynamical laws without invoking the fundamental postulates of statistical mechanics are scarce. Interestingly, one such model is found in…
Self-interested behavior in sharing economies often leads to inefficient aggregate outcomes compared to a centrally coordinated allocation, ultimately harming users. Yet, centralized coordination removes individual decision power. This…
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently propose a time delay and an action, and the action with the…
We study games with finitely many participants, each having finitely many choices. We consider the following categories of participants: (I) populations: sets of nonatomic agents, (II) atomic splittable players, (III) atomic non splittable…
Infinite games where several players seek to coordinate under imperfect information are deemed to be undecidable, unless the information is hierarchically ordered among the players. We identify a class of games for which joint winning…
This article considers a two-player strategic game for network routing under link disruptions. Player 1 (defender) routes flow through a network to maximize her value of effective flow while facing transportation costs. Player 2 (attacker)…
Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of…
People, robots, and companies mostly divide time and effort among projects, and \defined{shared effort games} model people investing resources in public endeavors and sharing the generated values. In linear $\theta$ sharing (effort) games,…
We consider finite-horizon and infinite-horizon versions of a dynamic game with $N$ selfish players who observe their types privately and take actions that are publicly observed. Players' types evolve as conditionally independent Markov…