中文
相关论文

相关论文: Monotonic Sequence Games

200 篇论文

We analyze the performance of the best-response dynamic across all normal-form games using a random games approach. The playing sequence -- the order in which players update their actions -- is essentially irrelevant in determining whether…

理论经济学 · 经济学 2022-11-18 Torsten Heinrich , Yoojin Jang , Luca Mungo , Marco Pangallo , Alex Scott , Bassel Tarbush , Samuel Wiese

We are interested in the convergence of the value of n-stage games as n goes to infinity and the existence of the uniform value in stochastic games with a general set of states and finite sets of actions where the transition is commutative.…

最优化与控制 · 数学 2016-04-22 Xavier Venel

We study a patrolling game played on a network $Q$, considered as a metric space. The Attacker chooses a point of $Q$ (not necessarily a node) to attack during a chosen time interval of fixed duration. The Patroller chooses a unit speed…

离散数学 · 计算机科学 2022-09-16 Steve Alpern , Thuy Bui , Thomas Lidbetter , Katerina Papadaki

We study in this paper three aspects of Mean Field Games. The first one is the case when the dynamics of each player depend on the strategies of the other players. The second one concerns the modeling of '' noise '' in discrete space models…

偏微分方程分析 · 数学 2018-08-02 Charles Bertucci , Jean Michel Lasry , Pierre Louis Lions

We consider an n-player symmetric stochastic game with weak interaction between the players. Time is continuous and the horizon and the number of states are finite. We show that the value function of each of the players can be approximated…

偏微分方程分析 · 数学 2018-07-13 Erhan Bayraktar , Asaf Cohen

Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment. Classical settings include mean-payoff games, where the…

计算机科学中的逻辑 · 计算机科学 2016-07-11 Patricia Bouyer , Nicolas Markey , Mickael Randour , Kim G. Larsen , Simon Laursen

We study pure-strategy Nash equilibria in multi-player concurrent deterministic games, for a variety of preference relations. We provide a novel construction, called the suspect game, which transforms a multi-player concurrent game into a…

计算机科学中的逻辑 · 计算机科学 2017-01-11 Patricia Bouyer , Romain Brenguier , Nicolas Markey , Michael Ummels

We present a systematic investigation of the quantum games, constructed using a novel repeated game protocol, when played repeatedly ad infinitum. We focus on establishing that such repeated games -- by virtue of inherent quantum-mechanical…

量子物理 · 物理学 2024-02-27 Archan Mukhopadhyay , Saikat Sur , Tanay Saha , Shubhadeep Sadhukhan , Sagar Chakraborty

Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment. Classical settings include mean-payoff games, where the…

计算机科学中的逻辑 · 计算机科学 2015-09-25 Patricia Bouyer , Nicolas Markey , Mickael Randour , Kim G. Larsen , Simon Laursen

Every simple game is a monotone Boolean function. For the other direction we just have to exclude the two constant functions. The enumeration of monotone Boolean functions with distinguishable variables is also known as the Dedekind's…

组合数学 · 数学 2025-02-03 Sascha Kurz , Dani Samaniego

Domineering is a two-player game played on a checkerboard in which one player places dominoes vertically, while the other places them horizontally. In this paper, we find out the minimum number of moves for a game of Domineering to end on…

组合数学 · 数学 2020-11-05 Rohan Karthikeyan , Siddharth Sinha

In a two-stage repeated classical game of prisoners' dilemma the knowledge that both players will defect in the second stage makes the players to defect in the first stage as well. We find a quantum version of this repeated game where the…

量子物理 · 物理学 2015-06-26 A. Iqbal , A. H. Toor

A Linear Quadratic Deterministic Continuous Time Game with many symmetric players is considered and the Linear Feedback Nash strategies are studied as the number of players goes to infinity. We show that under some conditions the limit of…

计算机科学与博弈论 · 计算机科学 2014-03-14 G. P. Papavassilopoulos

We consider stochastic differential games with a large number of players, with the aim of quantifying the gap between closed-loop, open-loop and distributed equilibria. We show that, under two different semi-monotonicity conditions, the…

概率论 · 数学 2025-05-06 Marco Cirant , Joe Jackson , Davide Francesco Redaelli

Various decomposition of finite games have been proposed. The inner product of vectors plays a key role in the decomposition of finite games. This paper considers the effect of different inner products on the orthogonal decomposition of…

最优化与控制 · 数学 2019-05-21 Changxi Li , Daizhan Cheng , Fenghua He

We consider a class of Mean Field Games in which the agents may interact through the statistical distribution of their states and controls. It is supposed that the Hamiltonian behaves like a power of its arguments as they tend to infinity,…

偏微分方程分析 · 数学 2020-06-24 Z Kobeissi

Something is definitely wrong. If the game has a linear winning strategy, then it is tractable. What's going on? Well, we describe a two-person game which has a definite winner, that is, a player who can force a win in a finite number of…

组合数学 · 数学 2016-09-07 Aviezri S. Fraenkel

We study a simple motion differential game of many pursuers and one evader in the plane. We give a nonempty closed convex set in the plane, and the pursuers and evader move on this set. They cannot leave this set during the game. Control…

最优化与控制 · 数学 2015-05-04 Idham Arif Alias , Gafurjan Ibragimov , Massimiliano Ferrara , Mehdi Salimi , Mansor Monsi

We define and analyze the notion of variational Wardrop equilibrium for nonatomic aggregative games with an infinity of players types. These equilibria are characterized through an infinite-dimensional variational inequality. We show, under…

最优化与控制 · 数学 2019-06-06 Paulin Jacquot , Cheng Wan

We consider a zero-sum continuous time stopping game in which the pay-off is revealed in the maximum of the two stopping times instead of the minimum, which is the case in Dynkin games.

概率论 · 数学 2015-07-28 Erhan Bayraktar , Zhou Zhou