Finding all Nash equilibria of a finite game using polynomial algebra (Q847806): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 6 users not shown)
Property / reviewed by
 
Property / reviewed by: Milan Mareš / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Milan Mareš / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SINGULAR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Gambit / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PHCpack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2102920598 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0612462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of roots of a system of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4210476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality of Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving polynomial equations. Foundations, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4293510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SINGULAR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oddness of the number of equilibrium points: a new proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopy methods to compute equilibria in game theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Method for Solving Sparse Polynomial Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton polytopes and the Bezout theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving parametric polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximal number of regular totally mixed Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expected number of real roots of a multihomogeneous system of polynomial equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for discussing Gröbner bases with parameters. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple search methods for finding a Nash equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Numerical Solution of Systems of Polynomials Arising in Engineering and Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4781203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonsingular matrix completion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 795 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:04, 2 July 2024

scientific article
Language Label Description Also known as
English
Finding all Nash equilibria of a finite game using polynomial algebra
scientific article

    Statements

    Finding all Nash equilibria of a finite game using polynomial algebra (English)
    0 references
    0 references
    19 February 2010
    0 references
    The paper deals with the sets of all Nash equilibria of some specific types of games, derived as a subset of complex roots of adequate polynomial systems. The method of finding these roots is described and discussed. Special regard is oriented to the application of Gröbner bases to that method. Finally, the software suitable for the analyzed model and method is reviewed.
    0 references
    0 references
    noncooperative game
    0 references
    Nash equilibrium
    0 references
    normal form game
    0 references
    algebraic variety
    0 references
    polynomial equation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references