A Simple P-Matrix Linear Complementarity Problem for Discounted Games (Q3507443): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_32 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2100114422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4287357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary pivot theory of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state Markovian decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique Sink Orientations of Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex sets of nonsingular and P:–Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bimatrix Equilibrium Points and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear complementarity problems solvable by A single linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Complementarity and P-Matrices for Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jumping Doesn’t Help in Abstract Cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:23, 28 June 2024

scientific article
Language Label Description Also known as
English
A Simple P-Matrix Linear Complementarity Problem for Discounted Games
scientific article

    Statements

    A Simple P-Matrix Linear Complementarity Problem for Discounted Games (English)
    0 references
    0 references
    0 references
    19 June 2008
    0 references
    Discounted game
    0 references
    linear complementarity problem
    0 references
    P-matrix
    0 references
    strategy improvement algorithm
    0 references
    unique sink orientation
    0 references
    zero-sum game
    0 references

    Identifiers