research
∙
08/31/2023
Dually conformal hypergraphs
Given a hypergraph ℋ, the dual hypergraph of ℋ is the hypergraph of all ...
share
research
∙
08/26/2022
Avoidability beyond paths
The concept of avoidable paths in graphs was introduced by Beisegel, Chu...
research
∙
04/21/2022
On Nash-Solvability of Finite Two-Person Tight Vector Game Forms
We consider finite two-person normal form games. The following four prop...
research
∙
02/23/2022
Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies
We prove that a deterministic n-person shortest path game has a Nash equ...
research
∙
11/13/2021
On Nash-solvability of finite n-person shortest path games; bi-shortest path conjecture
We formulate a conjecture from graph theory that is equivalent to Nash-s...
research
∙
11/11/2021
On Nash-solvability of finite n-person deterministic graphical games; Catch 22
We consider finite n-person deterministic graphical (DG) games. These ga...
research
∙
08/11/2021
Polynomial algorithms computing two lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
In 1975 the first author proved that every finite tight two-person game ...
research
∙
04/15/2021
Logical contradictions in the One-way ANOVA and Tukey-Kramer multiple comparisons tests with more than two groups of observations
We show that the One-way ANOVA and Tukey-Kramer (TK) tests agree on any ...
research
∙
04/15/2021
On Nash-solvability of n-person graphical games under Markov's and a priori realizations
We consider graphical n-person games with perfect information that have ...
research
∙
08/03/2020
Shifting paths to avoidable ones
An extension of an induced path P in a graph G is an induced path P' suc...
research
∙
08/02/2020
On the degree sequences of dual graphs on surfaces
Given two graphs G and G^* with a one-to-one correspondence between thei...
research
∙
01/12/2020
Computational Hardness of Multidimensional Subtraction Games
We study algorithmic complexity of solving subtraction games in a fixed ...
research
∙
07/28/2019
Avoidable Vertices and Edges in Graphs
A vertex in a graph is simplicial if its neighborhood forms a clique. We...
research
∙
05/09/2018
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs
A hypergraph H is said to be 1-Sperner if for every two hyperedges the s...
research
∙
11/30/2017
Generalizing Gale's theorem on backward induction and domination of strategies
In 1953 Gale noticed that for every n-person game in extensive form with...
research
∙
11/02/2017