Filters








1,575 Hits in 5.5 sec

Strategic Network Interdiction

Sunghoon Hong
2011 Social Science Research Network  
The adversary incurs the expense of carrying bads. We characterize the Nash equilibria in terms of the primitives of our model.  ...  We develop a strategic model of network interdiction in a non-cooperative game of ‡ow. A security agency operates a network with arc capacities.  ...  Thus, in any max- ‡ow min-cut Nash equilibrium, the probability of the adversary damaging the target is 2 t . We provide an example of max- ‡ow min-cut Nash equilibria. is a max- ‡ow strategy.  ... 
doi:10.2139/ssrn.1868144 fatcat:2c4e7owygjbk5chbokptdwz7nu

Strategic network interdiction

Sunghoon Hong
2010 Proceedings of the Behavioral and Quantitative Game Theory on Conference on Future Directions - BQGT '10  
The adversary incurs the expense of carrying bads. We characterize the Nash equilibria in terms of the primitives of our model.  ...  We develop a strategic model of network interdiction in a non-cooperative game of ‡ow. A security agency operates a network with arc capacities.  ...  Thus, in any max- ‡ow min-cut Nash equilibrium, the probability of the adversary damaging the target is 2 t . We provide an example of max- ‡ow min-cut Nash equilibria. is a max- ‡ow strategy.  ... 
doi:10.1145/1807406.1807418 dblp:conf/bqgt/Hong10 fatcat:etnlojyjjnadvhfrxrofdqnl6m

When Should You Defend Your Classifier – A Game-theoretical Analysis of Countermeasures against Adversarial Examples [article]

Maximilian Samsinger, Florian Merkle, Pascal Schöttle, Tomas Pevny
2021 arXiv   pre-print
We scrutinize these assumptions and propose the advanced adversarial classification game, which incorporates all relevant parameters of an adversary and a defender.  ...  of adversarial examples.  ...  mixed strategy equilibria for our game.  ... 
arXiv:2108.07602v2 fatcat:irwbfb2rijauti46ql62qv3psq

Achieve Optimal Adversarial Accuracy for Adversarial Deep Learning using Stackelberg Game [article]

Xiao-Shan Gao, Shuang Liu, Lijia Yu
2022 arXiv   pre-print
In most previous work, adversarial deep learning was formulated as a simultaneous game and the strategy spaces are assumed to be certain probability distributions in order for the Nash equilibrium to exist  ...  The existence of Stackelberg equilibria for these games are proved.  ...  Nash equilibria do not necessarily exist, and mixed strategy Nash equilibria are usually considered.  ... 
arXiv:2207.08137v1 fatcat:ub74kq2mbnfptf2hirvbfdbf6i

Local Nash Equilibria are Isolated, Strict Local Nash Equilibria in `Almost All' Zero-Sum Continuous Games [article]

Eric Mazumdar, Lillian Ratliff
2020 arXiv   pre-print
We prove that differential Nash equilibria are generic amongst local Nash equilibria in continuous zero-sum games.  ...  Adversarial learning and generative adversarial network approaches are touted to be more robust than the alternative. Zero-sum games are at the heart of such approaches.  ...  local Nash equilibria in continuous zero-sum games (Theorem 2).  ... 
arXiv:2002.01007v1 fatcat:spoeiiv4jvd5lezooq2wcpj32y

An efficient heuristic approach for security against multiple adversaries

Praveen Paruchuri, Jonathan P. Pearce, Milind Tambe, Fernando Ordonez, Sarit Kraus
2007 Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems - AAMAS '07  
However, it is often the case in multiagent security domains that one agent can commit to a mixed strategy which its adversaries observe before choosing their own strategies.  ...  This paper focuses on domains where these threats come from unknown adversaries. These domains can be modeled as Bayesian games; much work has been done on finding equilibria for such games.  ...  The highest-reward Bayes-Nash equilibria were used in order to demonstrate the higher reward gained by looking for an optimal policy rather than an equilibria in Stackelberg games such as our security  ... 
doi:10.1145/1329125.1329344 dblp:conf/atal/ParuchuriPTOK07 fatcat:rcp7peu2ebgwlftp4pgsczg32a

Coordination mechanisms for congestion games

Marek Chrobak, Elias Koutsoupias
2004 ACM SIGACT News  
Open Problem 1 (Fully-mixed Nash equilibrium conjecture) The fullymixed equilibrium, when it exists, has the maximum makespan among all Nash equilibria.  ...  The situation faced by the users is essentially captured by a 3-player game which happens to have 5 Nash equilibria.  ... 
doi:10.1145/1054916.1054933 fatcat:ehonaytd4rdglkzq4qromhj36m

Anonymous networking with localized eavesdroppers: A game-theoretic approach

Parv Venkitasubramaniam, Lang Tong
2009 2009 43rd Annual Conference on Information Sciences and Systems  
Using numerical examples, the tradeoff between the achievable anonymity and the power of the adversary is demonstrated as a function of the throughput for passive and active adversaries.  ...  This problem is posed as a two player zero-sum game, and it is shown that a unique Nash equilibrium exists for a general category of finite networks.  ...  In the following section, we therefore formulate this problem as a two-player zero sum game, and establish the existence of Nash equilibria. III.  ... 
doi:10.1109/ciss.2009.5054731 dblp:conf/ciss/VenkitasubramaniamT09 fatcat:wy6cecmi6bhefjjgi5zypamjpm

Anonymous networking amidst active adversaries

Parv Venkitasubramaniam, Lang Tong
2009 MILCOM 2009 - 2009 IEEE Military Communications Conference  
Using numerical examples, the tradeoff between the achievable anonymity and the power of the adversary is demonstrated as a function of the throughput for passive and active adversaries.  ...  This problem is posed as a two player zero-sum game, and it is shown that a unique Nash equilibrium exists for a general category of finite networks.  ...  In the following section, we therefore formulate this problem as a two-player zero sum game, and establish the existence of Nash equilibria. III.  ... 
doi:10.1109/milcom.2009.5379947 fatcat:v6eznu3x3ndovizd52mtknkg6a

The Power Allocation Game on A Network: Computation Issue [article]

Yuke Li, Jiahua Yue, Fengjiao Liu, A. Stephen Morse
2018 arXiv   pre-print
In this paper two algorithms with the goal of generating the equilibrium set of the power allocation game first developed in allocation are proposed.  ...  Based on the first algorithm, the geometric property of the pure strategy Nash equilibrium set will be proven to be a collection of convex polytopes.  ...  Second, by the nature of the power allocation game itself, a pure strategy Nash equilibrium is easier to be described and more realistic than a mixed strategy Nash equilibrium.  ... 
arXiv:1805.02138v1 fatcat:pz4qquljb5hevortkkjlusz6oa

Mixed Strategy Nash Equilibria in Signaling Games

Barry R. Cobb, Atin Basuchoudhary, Gregory Hartman
2013 Theoretical Economics Letters  
In this paper, decision trees are used to derive Nash equilibrium strategies for signaling games.  ...  We address the situation where neither player has any pure strategies at Nash equilibrium, i.e. a purely mixed strategy equilibrium.  ...  Decision trees provide a convenient acilitate the calculation of purely mixed Nash equilibria in signaling games.  ... 
doi:10.4236/tel.2013.31009 fatcat:hvi3yjvtlbfz5kacgxgmwck5he

Game theory, learning, and control systems

Jeff S Shamma
2019 National Science Review  
When many control systems are interconnected, the result can be viewed through the lens of game theory.  ...  Game theory is the study of interacting decision makers, whereas control systems involve the design of intelligent decision-making devices.  ...  A game may have multiple Nash equilibria, resulting in an issue of nonuniqueness.  ... 
doi:10.1093/nsr/nwz163 pmid:34692132 pmcid:PMC8288873 fatcat:phry7dcr7fbylhxfgvdoaf443u

Quantum Solution of Coordination Problems

Bernardo A. Huberman, Tad Hogg
2003 Quantum Information Processing  
Unlike prior proposals for quantum games our approach retains the same choices as in the classical game and instead utilizes quantum entanglement as an extra resource to aid the participants in their choices  ...  Using the properties of entangled states, this quantum mechanism allows participants to rapidly find suitable correlated choices as an alternative to conventional approaches relying on explicit communication  ...  Coordination problems have long been studied in the context of game theory, (5, 9, 19) where the coordination game is specified by a payoff matrix which yields several Nash equilibria.  ... 
doi:10.1023/b:qinp.0000042201.34328.61 fatcat:t5v23njotjf7tlflka5mn75kzm

Teamwork makes von Neumann work: Min-Max Optimization in Two-Team Zero-Sum Games [article]

Fivos Kalogiannis, Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis
2021 arXiv   pre-print
Specifically, we present a family of team games whose induced utility is non multi-linear with non attractive per-se mixed Nash Equilibria, as strict saddle points of the underlying optimization landscape  ...  Unlike the textbook two-player zero-sum games, finding a Nash equilibrium in our class can be shown to be CLS-hard, i.e., it is unlikely to have a polynomial-time algorithm for computing Nash equilibria  ...  Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not 18 necessarily reflect the views of the National Science Foundation (NSF).  ... 
arXiv:2111.04178v3 fatcat:srw4ljcc5jcapev3ywsklokm7m

Quantum Solution of Coordination Problems

Bernardo A. Huberman, Tad Hogg
2003 Social Science Research Network  
Unlike prior proposals for quantum games our approach retains the same choices as in the classical game and instead utilizes quantum entanglement as an extra resource to aid the participants in their choices  ...  Using the properties of entangled states, this quantum mechanism allows participants to rapidly find suitable correlated choices as an alternative to conventional approaches relying on explicit communication  ...  Coordination problems have long been studied in the context of game theory, (5, 9, 19) where the coordination game is specified by a payoff matrix which yields several Nash equilibria.  ... 
doi:10.2139/ssrn.417080 fatcat:fylfnyymmbfwrdsfkpofnt3ovy
« Previous Showing results 1 — 15 out of 1,575 results