3 papers
cs.GT2023
Graphical One-Sided Markets with Exchange Costs
Takashi Ishizuka
This paper proposes a new one-sided matching market model in which every agent has a cost function that is allowed to take a negative value. Our model aims to capture the situation…
cs.GT2022
On Finding Pure Nash Equilibria of Discrete Preference Games and Network Coordination Games
Takashi Ishizuka, Naoyuki Kamiyama
This paper deals with the complexity of the problem of computing a pure Nash equilibrium for discrete preference games and network coordination games beyond -treewidth a…
cs.GT2022
NP-hardness of Computing Uniform Nash Equilibria on Planar Bimatrix Games
Takashi Ishizuka, Naoyuki Kamiyama
We study the complexity of computing a uniform Nash equilibrium on a non-win-lose bimatrix game. It is known that such a problem is NP-complete even if a bimatrix game is win-lose…