Games of timing related to distribution of resources (Q1093572): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Games of timing with resources of mixed type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-noisy-versus-one-silent duel with equal accuracy functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a noisy-silent-versus-silent duel with equal accuracy functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3245651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noisy Duels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duels with Continuous Firing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Silent Duels with Nondiscrete Firing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-discrete silent duels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic properties of non-discrete duels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic properties of discrete duels / rank
 
Normal rank

Latest revision as of 12:58, 18 June 2024

scientific article
Language Label Description Also known as
English
Games of timing related to distribution of resources
scientific article

    Statements

    Games of timing related to distribution of resources (English)
    0 references
    1988
    0 references
    The paper considers a class of zero-sum, two-person games which are related to the distribution of resources. Each of the players is in possession of an amount of resource, to be distributed by him in the time interval [0,1] according to an arbitrary measure. The payoff function is defined in such a manner that the games are a generalization of the so- called silent nondiscrete duels. It is proven that these games have a value, and the optimal strategies for the players are found. The results of the paper bring to light new, essential elements, common to almost all games of timing on [0,1].
    0 references
    zero-sum, two-person games
    0 references
    distribution of resources
    0 references
    silent nondiscrete duels
    0 references
    optimal strategies
    0 references
    0 references

    Identifiers