Games against nature (Q1069296): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1223123
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Christos H. Papadimitriou / rank
 
Normal rank
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.1016/0022-0000(85)90045-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019851160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming and stochastic control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some two-person perfect-information games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131987 / rank
 
Normal rank

Latest revision as of 10:34, 17 June 2024

scientific article
Language Label Description Also known as
English
Games against nature
scientific article

    Statements

    Games against nature (English)
    0 references
    1985
    0 references
    We present a new characterization of PSPACE in terms of problems in a classical area in optimization, decision-making under uncertainty. These problems are modeled by certain games played against a disinterested opponent who makes moves at random. We show several natural problems of this sort to be PSPACE-complete.
    0 references
    0 references
    0 references
    0 references
    0 references
    PSPACE
    0 references
    decision-making under uncertainty
    0 references
    games played against a disinterested opponent
    0 references
    0 references
    0 references