Takashi Ishizuka @t-ishizuka - Tumblr Blog

Redirecting

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.

•18+ Adults Only

Watch Anya Live on Cam

Anya is live and ready to show you everything. Watch her strip, dance, and perform exclusive shows just for you. Interact in real-time and make your fantasies come true.

✓ Live Streaming✓ Interactive Chat✓ Private Shows✓ HD Quality✓ Free Actions

Free to watch • No registration required • HD streaming

Recently, Pasarkar et al. (2023) have introduced the new $${{\,\mathrm{\texttt{TFNP}}\,}}$$ TFNP subclass called $${{\,\mathrm{\texttt{PLC}}

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

口頭発表（予定）

LAシンポジウム, LA Symposium

Revisiting MA vs. ∃ · BPP: A Functional Analogue | Jxiv, JSTプレプリントサーバ

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

Recently, Pasarkar, Papadimitriou, and Yannakakis (ITCS 2023) have introduced the new TFNP subclass called PLC that contains the class PPP;

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

•18+ Adults Only

Watch Anya Live on Cam

Anya is live and ready to show you everything. Watch her strip, dance, and perform exclusive shows just for you. Interact in real-time and make your fantasies come true.

✓ Live Streaming✓ Interactive Chat✓ Private Shows✓ HD Quality✓ Free Actions

Free to watch • No registration required • HD streaming

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.

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

t-ishizuka

We study the complexity of computing a uniform Nash equilibrium on a bimatrix game. In general, it is known that such a problem is NP-comple

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

t-ishizuka

UPDATED:

The hardness result is strengthened.

t-ishizuka

UPDATED

v3: The hardness result is strengthened.

口頭発表

#taks #presentations

t-ishizuka

We study the complexity of computing a uniform Nash equilibrium on a bimatrix game. In general, it is known that such a problem is NP-comple

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

t-ishizuka

UPDATED:

The hardness result is strengthened.

This paper deals with the complexity of the problem of computing a pure Nash equilibrium for discrete preference games and network coordinat

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

#preprints

•18+ Adults Only

Watch Anya Live on Cam

Anya is live and ready to show you everything. Watch her strip, dance, and perform exclusive shows just for you. Interact in real-time and make your fantasies come true.

✓ Live Streaming✓ Interactive Chat✓ Private Shows✓ HD Quality✓ Free Actions

Free to watch • No registration required • HD streaming

口頭発表

#talks #presentations

We study the complexity of computing a uniform Nash equilibrium on a bimatrix game. In general, it is known that such a problem is NP-comple

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

#preprints

口頭発表

第18回数学総合若手研究集会

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

#talks #presentations

口頭発表

2021年度　冬のLAシンポジウム　プログラム

#talks #presentations

ポスター発表

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

•18+ Adults Only

Watch Anya Live on Cam

Anya is live and ready to show you everything. Watch her strip, dance, and perform exclusive shows just for you. Interact in real-time and make your fantasies come true.

✓ Live Streaming✓ Interactive Chat✓ Private Shows✓ HD Quality✓ Free Actions

Free to watch • No registration required • HD streaming

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

Trending Blogs

Last Seen Blogs

Takashi Ishizuka