Results 81 to 90 of about 757 (200)
A simplicial algorithm approach to Nash equilibria in concave games
, 2006 Haake C-J, Su FE. A simplicial algorithm approach to Nash equilibria in concave games. Working Papers. Institute of Mathematical Economics. Vol 382.
Claus-jochen Haake +3 more
core
A simplicial algorithm approach to Nash equilibria in concave games [PDF]
In this paper we demonstrate a new method for computing approximate Nash equilibria in n-person games. Strategy spaces are assumed to be represented by simplices, while payoff functions are assumed to be concave.
Claus-Jochen Haake, Francis Edward Su
core
An algorithm for payoff space in C1-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
An impossibility theorem in game dynamics. [PDF]
Proc Natl Acad Sci U S A, 2023 Milionis J +3 more
europepmc +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
Constant rank bimatrix games are PPAD-hard [PDF]
Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014 The rank of a bimatrix game (A,B) is defined as rank(A+B). Computing a Nash equilibrium (NE) of a rank-$0$, i.e., zero-sum game is equivalent to linear programming (von Neumann'28, Dantzig'51). In 2005, Kannan and Theobald gave an FPTAS for constant rank games, and asked if there exists a polynomial time algorithm to compute an exact NE.
openaire +2 more sources
Centralised Decision Support in Maritime Vessel Traffic Services: A Polymatrix Game Solution
IEEE AccessGiven the increasing complexity of maritime traffic, particularly with the growing integration of autonomous vessels alongside conventional vessels, the need for enhanced coordination and decision support systems has become critical to ensure safety and ...
Luka Grgicevic +4 more
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
A Taxonomy of Best-Reply Multifunctions in 2x2x2 Trimatrix Games
This paper provides an overview of the various shapes the best- reply multifunctions can take in 2×2×2 trimatrix games. It is shown that, unlike in 2×2 bimatrix games, the best replies to the opponents’ pure strategies do not completely determine the ...
Borm, P.E.M. +3 more
core
The Structure of the Set of Equilibria for Two Person Multicriteria Games
In this paper the structure of the set of equilibria for two person multicriteria games is analysed. It turns out that the classical result for the set of equilibria for bimatrix games, that it is a finite union of polytopes, is only valid for ...
Borm, P.E.M. +2 more
core