All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Total tightness implies Nash-solvability for three-person game forms

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10127481" target="_blank" >RIV/00216208:11320/12:10127481 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.disc.2011.12.028" target="_blank" >http://dx.doi.org/10.1016/j.disc.2011.12.028</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.disc.2011.12.028" target="_blank" >10.1016/j.disc.2011.12.028</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Total tightness implies Nash-solvability for three-person game forms

  • Original language description

    It was recently shown that every totally tight two-person game form is acyclic, dominance-solvable, and hence. Nash-solvable too. In this paper, we exhibit an example showing that the first two implications fail for the three-person (n = 3) game forms. Yet, we show that the last one (total tightness implies Nash-solvability) still holds for n = 3 leaving the case n > 3 open.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP202%2F10%2F1188" target="_blank" >GAP202/10/1188: KnowSched: Knowledge Techniques in Scheduling</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2012

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Discrete Mathematics

  • ISSN

    0012-365X

  • e-ISSN

  • Volume of the periodical

    312

  • Issue of the periodical within the volume

    8

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    8

  • Pages from-to

    1436-1443

  • UT code for WoS article

    000301702000006

  • EID of the result in the Scopus database