Alternating minima and maxima, Nash equilibria and bounded arithmetic

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F12%3A00374023" target="_blank" >RIV/67985840:_____/12:00374023 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.apal.2011.06.014" target="_blank" >http://dx.doi.org/10.1016/j.apal.2011.06.014</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.apal.2011.06.014" target="_blank" >10.1016/j.apal.2011.06.014</a>

Result language
angličtina
Original language name
Alternating minima and maxima, Nash equilibria and bounded arithmetic
Original language description
We show that the least number principle for (strict ) formulas can be characterized by the existence of alternating minima and maxima of length k. We show simple prenex forms of these formulas whose herbrandizations (by polynomial time functions) are formulas that characterize theorems of the levels of the Bounded Arithmetic Hierarchy, and we derive from this another characterization, in terms of a search problem about finding pure Nash equilibria in k-turn games.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/IAA100190902" target="_blank" >IAA100190902: Mathematical logic, complexity, and algorithms</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)