Total tightness implies Nash-solvability for three-person game forms - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Endre Boros, Ondrej Cepek, Vladimir Gurvich. Total tightness implies Nash-solvability for three-person game forms. Discrete Mathematics, 312(8):1436-1443, 2012. [doi]

The following publications are possibly variants of this publication:

Acyclic, or totally tight, two-person game forms: Characterization and main propertiesEndre Boros, Vladimir Gurvich, Kazuhisa Makino, Dávid Papp. DM, 310(6-7):1135-1151, 2010. [doi]

Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game formsVladimir Gurvich, Mariya Naumova. AMAI, 92(1):49-57, January 2024. [doi]

Nash-solvable two-person symmetric cycle game formsEndre Boros, Vladimir Gurvich, Kazuhisa Makino, Wei Shao. DAM, 159(15):1461-1487, 2011. [doi]

Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oraclesVladimir Gurvich, Mariya Naumova. DAM, 340:53-68, December 2023. [doi]

runs on WebDSL