Game theory for network security
X Liang, Y Xiao - IEEE Communications Surveys & Tutorials, 2012 - ieeexplore.ieee.org
As networks become ubiquitous in people's lives, users depend on networks a lot for
sufficient communication and convenient information access. However, networks suffer from …
sufficient communication and convenient information access. However, networks suffer from …
Game theory and control
Game theory is the study of decision problems in which there are multiple decision makers
and the quality of a decision maker's choice depends on both that choice and the choices of …
and the quality of a decision maker's choice depends on both that choice and the choices of …
A survey and critique of multiagent deep reinforcement learning
Deep reinforcement learning (RL) has achieved outstanding results in recent years. This has
led to a dramatic increase in the number of applications and methods. Recent works have …
led to a dramatic increase in the number of applications and methods. Recent works have …
Distributed Nash equilibrium seeking in games with partial decision information: A survey
M Ye, QL Han, L Ding, S Xu - Proceedings of the IEEE, 2023 - ieeexplore.ieee.org
Nash equilibrium, as an essential strategic profile in game theory, is of both practical
relevance and theoretical significance due to its wide penetration into various fields, such as …
relevance and theoretical significance due to its wide penetration into various fields, such as …
Deep reinforcement learning from self-play in imperfect-information games
J Heinrich, D Silver - arXiv preprint arXiv:1603.01121, 2016 - arxiv.org
Many real-world applications can be described as large-scale games of imperfect
information. To deal with these challenging domains, prior work has focused on computing …
information. To deal with these challenging domains, prior work has focused on computing …
Distributed Nash equilibrium seeking by a consensus based approach
M Ye, G Hu - IEEE Transactions on Automatic Control, 2017 - ieeexplore.ieee.org
In this paper, Nash equilibrium seeking among a network of players is considered. Different
from many existing works on Nash equilibrium seeking in noncooperative games, the …
from many existing works on Nash equilibrium seeking in noncooperative games, the …
A passivity-based approach to Nash equilibrium seeking over networks
In this paper, we consider the problem of distributed Nash equilibrium (NE) seeking over
networks, a setting in which players have limited local information on the others' decisions …
networks, a setting in which players have limited local information on the others' decisions …
Consensus and cooperation in networked multi-agent systems
R Olfati-Saber, JA Fax, RM Murray - Proceedings of the IEEE, 2007 - ieeexplore.ieee.org
This paper provides a theoretical framework for analysis of consensus algorithms for multi-
agent networked systems with an emphasis on the role of directed information flow …
agent networked systems with an emphasis on the role of directed information flow …
Learning in repeated auctions with budgets: Regret minimization and equilibrium
SR Balseiro, Y Gur - Management Science, 2019 - pubsonline.informs.org
In online advertising markets, advertisers often purchase ad placements through bidding in
repeated auctions based on realized viewer information. We study how budget-constrained …
repeated auctions based on realized viewer information. We study how budget-constrained …
Nash equilibrium seeking in noncooperative games
We introduce a non-model based approach for locally stable convergence to Nash equilibria
in static, noncooperative games with N players. In classical game theory algorithms, each …
in static, noncooperative games with N players. In classical game theory algorithms, each …