<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>PPAD-Completeness | PAIR Lab: PKU Alignment and Interaction Research Lab</title><link>https://pair-lab.ai/tag/ppad-completeness/</link><atom:link href="https://pair-lab.ai/tag/ppad-completeness/index.xml" rel="self" type="application/rss+xml"/><description>PPAD-Completeness</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Sun, 01 Jan 2023 00:00:00 +0000</lastBuildDate><image><url>https://pair-lab.ai/media/icon_hu4f2a7092ab9dace538e8dee71ba34a1a_30036_512x512_fill_lanczos_center_3.png</url><title>PPAD-Completeness</title><link>https://pair-lab.ai/tag/ppad-completeness/</link></image><item><title>On the Complexity of Computing Markov Perfect Equilibrium in General-Sum Stochastic Games</title><link>https://pair-lab.ai/publication/nsr/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://pair-lab.ai/publication/nsr/</guid><description/></item></channel></rss>