Monotone bargaining is Nash-solvable (Q1801037): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2018.04.013 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963581906 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1711.00940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash-solvable two-person symmetric cycle game forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck extrema / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4695866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight cyclic game forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4278495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The solvability of positional games in pure strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3821979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Criteria of nonemptiness of dual cores / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual cores and effectivity functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3384162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3332693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bargaining Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Person Cooperative Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5591258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE TWO-COLOURING OF HYPERGRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong-connectivity algorithm and its applications in data flow analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic graphical games / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129354462 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2018.04.013 / rank
 
Normal rank

Latest revision as of 09:37, 16 December 2024

scientific article
Language Label Description Also known as
English
Monotone bargaining is Nash-solvable
scientific article

    Statements

    Monotone bargaining is Nash-solvable (English)
    0 references
    26 October 2018
    0 references
    monotone bargaining game
    0 references
    deal
    0 references
    game form
    0 references
    game correspondence
    0 references
    Nash equilibrium
    0 references
    Nash-solvability
    0 references
    tightness
    0 references
    0 references
    0 references

    Identifiers

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