8 citations · 15 across the 14 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.GT2013
EGuaranteeNash for Boolean Games is NEXP-Hard
Egor Ianovski, Luke Ong
Boolean games are an expressive and natural formalism through which to investigate problems of strategic interaction in multiagent systems. Although they have been widely studied,…
math.LO2013★ 1 cited
Complexity of equivalence relations and preorders from computability theory
Egor Ianovski, Keng Meng Ng, Russell Miller +1
We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations , a componentwise reducibility…
cs.FL2013★ 2 cited
Computable Component-wise Reducibility
Egor Ianovski
We consider equivalence relations and preorders complete for various levels of the arithmetical hierarchy under computable, component-wise reducibility. We show that implication in…