English
Related papers

Related papers: On Stackelberg Mixed Strategies

200 papers

We investigate the equilibrium stability and robustness in a class of moving target defense problems, in which players have both incomplete information and asymmetric cognition. We first establish a Bayesian Stackelberg game model for…

Computer Science and Game Theory · Computer Science 2025-04-15 Hanzheng Zhang , Zhaoyang Cheng , Guanpu Chen , Karl Henrik Johansson

The paper [Ras15a] introduced distribution-valued games. This game-theoretic model uses probability distributions as payoffs for games in order to express uncertainty about the payoffs. The player's preferences for different payoffs are…

Optimization and Control · Mathematics 2021-03-26 Vincent Bürgin

We study a class of stochastic dynamic games that exhibit strategic complementarities between players; formally, in the games we consider, the payoff of a player has increasing differences between her own state and the empirical…

Computer Science and Game Theory · Computer Science 2010-12-13 Sachin Adlakha , Ramesh Johari

This paper proposes a new equilibrium concept "robust perfect equilibrium" for non-cooperative games with a continuum of players, incorporating three types of perturbations. Such an equilibrium is shown to exist (in symmetric mixed…

Theoretical Economics · Economics 2021-05-06 Enxian Chen , Lei Qiao , Xiang Sun , Yeneng Sun

In nature and society problems arise when different interests are difficult to reconcile, which are modeled in game theory. While most applications assume uncorrelated games, a more detailed modeling is necessary to consider the…

Physics and Society · Physics 2019-08-21 A. D. Correia , H. T. C. Stoof

Interdicting a criminal with limited police resources is a challenging task as the criminal changes location over time. The size of the large transportation network further adds to the difficulty of this scenario. To tackle this issue, we…

Artificial Intelligence · Computer Science 2026-04-08 Sukanya Samanta , Kei Kimura , Makoto Yokoo , Palash Dey

We study the conditions under which the iterated elimination of strictly dominated strategies is order independent and we identify a class of discontinuous games for which order does not matter. In this way, we answer the open problem…

Optimization and Control · Mathematics 2013-03-29 Monica Patriche

Repeated games are difficult to analyze, especially when agents play mixed strategies. We study one-memory strategies in iterated prisoner's dilemma, then generalize the result to k-memory strategies in repeated games. Our result shows that…

Computer Science and Game Theory · Computer Science 2019-02-26 Shiheng Wang , Fangzhen Lin

We present a new class of strategic games, mixed capability games, as a foundation for studying how different player capabilities impact the dynamics and outcomes of strategic games. We analyze the impact of different player capabilities…

Computer Science and Game Theory · Computer Science 2022-08-17 Kai Jia , Martin Rinard , Yichen Yang

Guided cooperation allows intelligent agents with heterogeneous capabilities to work together by following a leader-follower type of interaction. However, the associated control problem becomes challenging when the leader agent does not…

Systems and Control · Electrical Eng. & Systems 2024-02-01 Yuhan Zhao , Quanyan Zhu

We study a quantum game played by two players with restricted multiple strategies. It is found that in this restricted quantum game Nash equilibrium does not always exist when the initial state is entangled. At the same time, we find that…

Quantum Physics · Physics 2018-01-17 Bo Chen , Ying-Jun Ma , Gui Lu Long

A model of stochastic games where multiple controllers jointly control the evolution of the state of a dynamic system but have access to different information about the state and action processes is considered. The asymmetry of information…

Computer Science and Game Theory · Computer Science 2012-09-18 Ashutosh Nayyar , Abhishek Gupta , Cédric Langbort , Tamer Başar

We investigate an alternative concept of Nash equilibrium, m-equilibrium, which slightly resembles Harsanyi-Selten risk dominant equilibrium although it is a different notion. M-equilibria provide nontrivial solutions of normal form games…

Computer Science and Game Theory · Computer Science 2013-06-27 Krzysztof Leśniak

Min-max optimization problems (i.e., min-max games) have attracted a great deal of attention recently as their applicability to a wide range of machine learning problems has become evident. In this paper, we study min-max games with…

Computer Science and Game Theory · Computer Science 2022-08-23 Denizalp Goktas , Amy Greenwald

We identify a subtle security issue that impacts mechanism design in scenarios in which agents can absolutely commit to strategies. Absolute commitments allow the strategy of an agent to depend on the commitments made by the other agents.…

Computer Science and Game Theory · Computer Science 2024-01-26 Daji Landis , Nikolaj I. Schwartzbach

It is known that the generalized Nash equilibrium problem can be reformulated as a quasivariational inequality. Our aim in this work is to introduce a variational approach to study the existence of solutions for generalized ordinal Nash…

Optimization and Control · Mathematics 2023-01-31 Orestes Bueno , John Cotrina , Yboon García

Theory of quantum games is a new area of investigation that has gone through rapid development during the last few years. Initial motivation for playing games, in the quantum world, comes from the possibility of re-formulating quantum…

Quantum Physics · Physics 2007-05-23 Azhar Iqbal

A recent body of experimental literature has studied empirical game-theoretical analysis, in which we have partial knowledge of a game, consisting of observations of a subset of the pure-strategy profiles and their associated payoffs to…

Computer Science and Game Theory · Computer Science 2014-02-13 John Fearnley , Martin Gairing , Paul Goldberg , Rahul Savani

This paper presents a new model for word sense disambiguation formulated in terms of evolutionary game theory, where each word to be disambiguated is represented as a node on a graph whose edges represent word relations and senses are…

Artificial Intelligence · Computer Science 2017-04-07 Rocco Tripodi , Marcello Pelillo

It is well-known that for infinitely repeated games, there are computable strategies that have best responses, but no computable best responses. These results were originally proved for either specific games (e.g., Prisoner's dilemma), or…

Computer Science and Game Theory · Computer Science 2020-06-11 Jakub Dargaj , Jakob Grue Simonsen