Results 91 to 100 of about 875,430 (205)

An impossibility theorem in game dynamics. [PDF]

Proc Natl Acad Sci U S A, 2023
Milionis J, Papadimitriou C, Piliouras G, Spendlove K.   +3 more
europepmc   +1 more source

A Game-Theoretic Approach for Quantification of Strategic Behaviors in Digital Forensic Readiness

Journal of Cybersecurity and Privacy
Small and Medium-sized Enterprises (SMEs) face disproportionately high risks from Advanced Persistent Threats (APTs), which often evade traditional cybersecurity measures.
Mehrnoush Vaseghipanah, Sam Jabbehdari, Hamidreza Navidi   +2 more
doaj   +1 more source

Computing a proper equilibrium of a bimatrix game [PDF]

Proceedings of the 13th ACM Conference on Electronic Commerce, 2012
We provide the first pivoting-type algorithm that computes an exact proper equilibrium of a bimatrix game. This is achieved by using Lemke's algorithm to solve a linear complementarity problem (LCP) of polynomial size. This also proves that computing a simple refinement of proper equilibria for bimatrix game is PPAD-complete.
openaire   +1 more source

TRAJECTORIES OF DYNAMIC EQUILIBRIUM AND REPLICATOR DYNAMICS IN COORDINATION GAMES

Ural Mathematical Journal
The paper analyzes average integral payoff indices for trajectories of the dynamic equilibrium and replicator dynamics in bimatrix coordination games. In such games, players receive large payoffs when choosing the same type of behavior. A special feature
Nikolay A. Krasovskii, Alexander M. Tarasyev   +1 more
doaj   +1 more source

An algorithm for payoff space in C¹-games

Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2010
In this paper we present an algorithm implemented by MATLAB, and several examples completely realized by this algorithm, based on a method developed by one of the authors to determine the payoff-space of certain normal-form C1-games.
David Carfì, Angela Ricciardello
doaj   +1 more source

Genetic Algorithm for Approximation of Equilibrium Strategies within Finite Space of Actions in Bimatrix Games for Improving Telecommunication Interactions

Applied Computer Systems
To improve the network interaction step-wise process, a genetic algorithm is suggested for finding more stable solutions in bimatrix games. The algorithm is based on using an approach of successive approximation to an equilibrium situation within a ...
Romanuke Vadim
doaj   +1 more source

Joint Probabilities Approach to Quantum Games with Noise. [PDF]

Entropy (Basel), 2023
Legón AR, Medina E.
europepmc   +1 more source

On the complexity of deciding bimatrix games similarity

Theoretical Computer Science, 2008
The paper deals with computational aspects of finding Nash equilibria in bimatrix games. The attention is focused on specific situation of similarity between two games, namely whether they share a common Nash equilibrium (so called weak similarity) or if their sets of Nash equilibria are identical (strong similarity).
openaire   +3 more sources

Dilemma breaking in quantum games by joint probabilities approach. [PDF]

Sci Rep, 2022
Legón AR, Medina E.
europepmc   +1 more source

Efficiency of Classical and Quantum Games Equilibria. [PDF]

Entropy (Basel), 2021
Szopa M.
europepmc   +1 more source