Related papers: Game-theoretic perspective of Ping-Pong Protocol
We consider the inverse problem of dynamic games, where cost function parameters are sought which explain observed behavior of interacting players. Maximum entropy inverse reinforcement learning is extended to the N-player case in order to…
In this paper an N-pursuer vs. M-evader team conflict is studied. The differential game of border defense is addressed and we focus on the game of degree in the region of the state space where the pursuers are able to win. This work extends…
The properties of the Cournot model based on the most general entanglement operator containing quadratic expressions which is symmetric with respect to the exchange of players are considered. The degree of entanglement of games dependent on…
Consider an important meeting to be held in a team-based organization. Taking availability constraints into account, an online scheduling poll is being used in order to decide upon the exact time of the meeting. Decisions are to be taken…
Designing optimal interdependent networks is important for the robustness and efficiency of national critical infrastructures. Here, we establish a two-person game-theoretic model in which two network designers choose to maximize the global…
When two or more self-interested agents put their plans to execution in the same environment, conflicts may arise as a consequence, for instance, of a common utilization of resources. In this case, an agent can postpone the execution of a…
Since the seminal PPAD-completeness result for computing a Nash equilibrium even in two-player games, an important line of research has focused on relaxations achievable in polynomial time. In this paper, we consider the notion of…
Although it has been known since the 1970s that a globally optimal strategy profile in a common-payoff game is a Nash equilibrium, global optimality is a strict requirement that limits the result's applicability. In this work, we show that…
Evolutionary $2 \times 2$ games are studied with players located on a square lattice. During the evolution the randomly chosen neighboring players try to maximize their collective income by adopting a random strategy pair with a probability…
We carry out a game-theoretic analysis of the recursive game "Guts," a variant of poker featuring repeated play with possibly growing stakes. An interesting aspect of such games is the need to account for funds lost to all players if…
This paper studies the optimization of strategies in the context of possibly randomized two players zero-sum games with incomplete information. We compare 5 algorithms for tuning the parameters of strategies over a benchmark of 12 games. A…
We cast the design of parameterized quantum circuits as a four-player potential game whose state is a circuit directed acyclic graph (DAG) and whose players encode trainability, non-stabilizerness, task performance, and hardware cost.…
With respect to probabilistic mixtures of the strategies in non-cooperative games, quantum game theory provides guarantee of fixed-point stability, the so-called Nash equilibrium. This permits players to choose mixed quantum strategies that…
We introduce a network design game where the objective of the players is to design the interconnections between the nodes of two different networks $G_1$ and $G_2$ in order to maximize certain local utility functions. In this setting, each…
The design of Nash equilibrium seeking strategies for games in which the involved players are of second-order integrator-type dynamics is investigated in this paper. Noticing that velocity signals are usually noisy or not available for…
We propose a game-theoretic framework to study the outcomes of packetized payments, a cross-ledger transaction protocol, with strategic and possibly malicious agents. We derive the transaction failure rate and demonstrate that without…
We investigate the existence of certain types of equilibria (Nash, $\varepsilon$-Nash, subgame perfect, $\varepsilon$-subgame perfect, Pareto-optimal) in multi-player multi-outcome infinite sequential games. We use two fundamental…
Reinforcement learning from human feedback (RLHF) has emerged as the standard paradigm for aligning large language models with human preferences. However, reward-based methods grounded in the Bradley-Terry assumption struggle to capture the…
We present a framework that incorporates the idea of bounded rationality into dynamic stochastic pursuit-evasion games. The solution of a stochastic game is characterized, in general, by its (Nash) equilibria in feedback form. However,…
A major limitation of open P2P networks is the lack of strong identities. This allows any agent to attack the system by creating multiple false personas, thereby disrupting the overlay network's connectivity and sabotaging its operation. In…