Alternating minima and maxima, Nash equilibria and bounded arithmetic
type: Item
instance of: scholarly article
title: Alternating minima and maxima, Nash equilibria and bounded arithmetic
zbMATH Open document ID: 1345.03108
author: Pavel Pudlák
author: Neil Thapen
published in: Annals of Pure and Applied Logic
publication date: 2012-03-13T00:00:00Z
Mathematics Subject Classification ID: 03F20
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03F25
Mathematics Subject Classification ID: 03F30
Mathematics Subject Classification ID: 91A80
Mathematics Subject Classification ID: 91A10
zbMATH DE Number: 6014283
zbMATH Keywords: proof complexity
zbMATH Keywords: bounded arithmetic
zbMATH Keywords: search problems
zbMATH Keywords: finite games
zbMATH Keywords: computational complexity
zbMATH Keywords: equilibria
MaRDI profile type: Publication
full work available at URL: j.apal.2011.06.014
OpenAlex ID: W2093643669
cites work: Algorithms and Computation
cites work: The relative complexity of NP search problems
cites work: POLYNOMIAL LOCAL SEARCH IN THE POLYNOMIAL HIERARCHY AND WITNESSING IN FRAGMENTS OF BOUNDED ARITHMETIC
cites work: Q3794177
cites work: An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic
cites work: The complexity of pure Nash equilibria
cites work: What are the \(\forall \Sigma_ 1^ b\)-consequences of \(T_ 2^ 1\) and \(T_ 2^ 2\)?
cites work: The strength of sharply bounded induction
cites work: How easy is local search?
cites work: Q4856172
cites work: NP search problems in low fragments of bounded arithmetic
cites work: Theory of games and economic behavior.
cites work: Fragments of bounded arithmetic and the lengths of proofs
cites work: The provably total search problems of bounded arithmetic
DOI: 10.1016/J.APAL.2011.06.014
description: scientific article; zbMATH DE number 6014283