18 citations · 43 across the 32 of their papers we have counts for
40 papers
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…
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…
Towards Optimal Subsidy Bounds for Envy-freeable Allocations
Yasushi Kawase, Kazuhisa Makino, Hanna Sumita +2
We study the fair division of indivisible items with subsidies among agents, where the absolute marginal valuation of each item is at most one. Under monotone valuations (where…
A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems
Kei Kimura, Kazuhisa Makino
Linear programming (LP) problems with gainfree Leontief substitution systems have been intensively studied in economics and operations research, and include the feasibility problem…
Matroid Horn functions
Kristóf Bérczi, Endre Boros, Kazuhisa Makino
Hypergraph Horn functions were introduced as a subclass of Horn functions that can be represented by a collection of circular implication rules. These functions possess distinguish…
Hypergraph Horn functions
Kristóf Bérczi, Endre Boros, Kazuhisa Makino
Horn functions form a subclass of Boolean functions possessing interesting structural and computational properties. These functions play a fundamental role in algebra, artificial i…