33 citations · 81 across the 32 of their papers we have counts for
38 papers
Polynomial Binary Optimization
Endre Boros
In a binary polynomial optimization problem (BPO, in short) we are maximizing a multilinear polynomial expression depending on n binary variables. This is a hard optimization class…
On Nash Equilibria in Play-Once and Terminal Deterministic Graphical Games
Endre Boros, Vladimir Gurvich, Kazuhisa Makino
We consider finite -person deterministic graphical games and study the existence of pure stationary Nash-equilibrium in such games. We assume that all infinite plays are equival…
Two-person Positive Shortest Path Games Have Nash Equilibria in Pure Stationary Strategies
Endre Boros, Khaled Elbassioni, Vladimir Gurvich +1
We prove that every finite two-person shortest path game, where the local cost of every move is positive for each player, has a Nash equilibrium (NE) in pure stationary strategies,…
Conformality of Minimal Transversals of Maximal Cliques
Endre Boros, Vladimir Gurvich, Martin Milanič +2
Given a hypergraph , the dual hypergraph of is the hypergraph of all minimal transversals of . A hypergraph is conformal if it is the family of maximal cliques of a graph…
Computing Remoteness Functions of Moore, Wythoff, and Euclid's games
Endre Boros, Vladimir Gurvich, Kazuhisa Makino +1
We study remoteness function of impartial games introduced by Smith in 1966. The player who moves from a position can win if and only if is odd. Th…
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
Endre Boros, Vladimir Gurvich, Martin Milanič +1
Given a hypergraph , the dual hypergraph of is the hypergraph of all minimal transversals of . The dual hypergraph is always Sperner, that i…