t-ishizuka

[t-ishizuka]

Takashi Ishizuka. “On the Complexity of some restricted variants of Quotient Pigeon and a weak variant of Kőning,” Information Processing Letters, Vol. 190, 2025.

[t-ishizuka]

Takashi Ishizuka. “Note on Constrained Long Choice with Multiple Beginning Elements,” Theory of Computing Systems, vol. 69(2), 2025.

[t-ishizuka]

口頭発表（予定）

[t-ishizuka]

Takashi Ishizuka. “Revisiting MA vs. $\exisits \cdot$ BPP: A Functional Analogue, Jxiv 2023.

[t-ishizuka]

Takashi Ishizuka. “PLS is contained in PLC,” arXiv 2023.

[t-ishizuka]

Takashi Ishizuka. “Graphical One-Sided Markets with Exchange Costs,” arXiv, 2023.

[t-ishizuka]

UPDATED

v3: The hardness result is strengthened.

Takashi Ishizuka and Naoyuki Kamiyama. "NP-hardness of Computing Uniform Nash Equilibria on Planar Bimatrix Game," arXiv, 2022.

[t-ishizuka]

口頭発表

[t-ishizuka]

UPDATED:

The hardness result is strengthened.

Takashi Ishizuka and Naoyuki Kamiyama. "NP-hardness of Computing Uniform Nash Equilibria on Planar Bimatrix Game," arXiv, 2022.

[t-ishizuka]

Takashi Ishizuka and Naoyuki Kamiyama. "On Finding Pure Nash Equilibria of Discrete Preference Games and Network Coordination Games," arXiv, 2022.

[t-ishizuka]

口頭発表

[t-ishizuka]

Takashi Ishizuka and Naoyuki Kamiyama. "NP-hardness of Computing Uniform Nash Equilibria on Planar Bimatrix Game," arXiv, 2022.

[t-ishizuka]

口頭発表

テクニカルレポートはこちら

[t-ishizuka]

口頭発表

[t-ishizuka]

ポスター発表

石塚天，「頂点重み付きグラフ上の探索問題の難しさ」，『異分野・異業種交流会2021』，オンライン，2021年11月．

[t-ishizuka]

Takashi Ishizuka. “On the complexity of finding a Caristi’s fixed point”, Information Processing Letters, Vol. 170, 2021.

https://doi.org/10.1016/j.ipl.2021.106119