My point is exactly that P and PSPACE are not the same. Addition of an opponent cannot turn NP into P, so “decision problem” vs “zero-sum game”cannot be the distinction which defines the problem space.
Oh my—I completely misread the post, thinking it was comparing P vs PSPACE, when in fact it’s comparing NP to PSPACE. My point that competitive decisions are just a special-case of decision theory stands, but it’s far less important.
My point is exactly that P and PSPACE are not the same. Addition of an opponent cannot turn NP into P, so “decision problem” vs “zero-sum game”cannot be the distinction which defines the problem space.
Why do you think zero-sum game theory is P? The quantified Boolean formula problem is PSPACE-complete.
Oh my—I completely misread the post, thinking it was comparing P vs PSPACE, when in fact it’s comparing NP to PSPACE. My point that competitive decisions are just a special-case of decision theory stands, but it’s far less important.
Nevermind!