scientific article

zbMath0517.90094MaRDI QIDQ3666625

Vladimir A. Gurvich

Publication date: 1982

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

matrix gamesgames in extensive formduochromatic graphspairs of dual irredundant Boolean functions

Mathematics Subject Classification ID

2-person games (91A05) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (13)

Efficient parallel recognition algorithms of cographs and distance hereditary graphs ⋮ The read once formula of a series-parallel network ⋮ Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles ⋮ Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs ⋮ On linear rewriting systems for Boolean logic and some applications to proof theory ⋮ Stability of two player game structures ⋮ Combinatorial characterization of read-once formulae ⋮ Not complementary connected and not CIS \(d\)-graphs form weakly monotone families ⋮ Decomposing complete edge-chromatic graphs and hypergraphs. Revisited ⋮ Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games ⋮ Critical properties and complexity measures of read-once Boolean functions ⋮ Tight and effectively rectangular game forms: A Nash solvable class ⋮ Vertex- and edge-minimal and locally minimal graphs

This page was built for publication: