Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A generalisation of Nash's theorem with higher-order functionals (1301.4845v1)

Published 21 Jan 2013 in cs.LO and cs.GT

Abstract: The recent theory of sequential games and selection functions by Mar- tin Escardo and Paulo Oliva is extended to games in which players move simultaneously. The Nash existence theorem for mixed-strategy equilibria of finite games is generalised to games defined by selection functions. A normal form construction is given which generalises the game-theoretic normal form, and its soundness is proven. Minimax strategies also gener- alise to the new class of games and are computed by the Berardi-Bezem- Coquand functional, studied in proof theory as an interpretation of the axiom of countable choice.

Citations (8)

Summary

We haven't generated a summary for this paper yet.