A computational model of outguessing in two-player non-cooperative games (Q399507): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2478/ausi-2014-0019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997840310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Do People Rely on the Self-Interested Maximization of Others? An Experimental Test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4805737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Doctrine of Chances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic game theory: For playing games, not just for doing theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Chains and Stochastic Stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control Techniques for Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Chains / rank
 
Normal rank

Latest revision as of 21:44, 8 July 2024

scientific article
Language Label Description Also known as
English
A computational model of outguessing in two-player non-cooperative games
scientific article

    Statements

    A computational model of outguessing in two-player non-cooperative games (English)
    0 references
    0 references
    0 references
    19 August 2014
    0 references
    computational game theory
    0 references
    noncooperative games
    0 references
    outguessing
    0 references
    Markov chains
    0 references
    reasoning
    0 references
    communication networks
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references