On the public citation graph

A note on Ky Fan's minimax theorem

0 signed · 28 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01448847openalex-snapshot
Zur Theorie der Gesellschaftsspiele
inferredcites →https://doi.org/10.1073/pnas.39.1.42openalex-snapshot
Minimax Theorems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-306-48332-7_281openalex-snapshot
Minimax Theorems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_371openalex-snapshot
Minimax Theorems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3557-3_1openalex-snapshot
Minimax Theorems and Their Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-46802-5_5openalex-snapshot
On the existence of Nash-equilibrium in n-person generalized concave games
inferred← citeshttps://doi.org/10.1007/bf00052107openalex-snapshot
Extensions of Ky Fan section theorems and minimax inequality theorems
inferred← citeshttps://doi.org/10.1007/bf00058948openalex-snapshot
Topological intersection theorems of set-valued mappings without closed graphs and their applications
inferred← citeshttps://doi.org/10.1007/bf01874121openalex-snapshot
A note on König's minimax theorem
inferred← citeshttps://doi.org/10.1007/bf01874462openalex-snapshot
A simple proof for König's minimax theorem
inferred← citeshttps://doi.org/10.1007/bf01874944openalex-snapshot
A flexible minimax theorem
inferred← citeshttps://doi.org/10.1007/bf01903847openalex-snapshot
A general saddle point theorem and its applications
inferred← citeshttps://doi.org/10.1007/bf01950292openalex-snapshot
Note on my paper “a simple proof for von Neumann's minimax theorem”
inferred← citeshttps://doi.org/10.1007/bf01950707openalex-snapshot
Minimax theorems for interval spaces
inferred← citeshttps://doi.org/10.1007/bf01950717openalex-snapshot
On some convexities
inferred← citeshttps://doi.org/10.1016/j.jmaa.2006.06.038openalex-snapshot
Nash equilibrium and minimax theorem with C -concavity
inferred← citeshttps://doi.org/10.1016/j.na.2005.01.072openalex-snapshot
Existence of Nash equilibria with -convexity
inferred← citeshttps://doi.org/10.1016/s0898-1221(02)00228-6openalex-snapshot
The existence of Nash equilibrium in n-person games with C-concavity
inferred← citeshttps://doi.org/10.1023/a:1006554508961openalex-snapshot
On Some Special Pseudoconvex Spaces
inferred← citeshttps://doi.org/10.1023/a:1008252724328openalex-snapshot
inferred← citeshttps://doi.org/10.1023/a:1022679504350openalex-snapshot
New Saddle Point Theorem Beyond Topological Vector Spaces
inferred← citeshttps://doi.org/10.1080/01630569608816703openalex-snapshot
Topological intersection theorems for two set—valued mappings and applications to minimax inequalities
inferred← citeshttps://doi.org/10.1109/tac.2022.3232637openalex-snapshot
Fast Approximate Dynamic Programming for Input-Affine Dynamics
inferred← citeshttps://doi.org/10.1109/tit.2010.2090221openalex-snapshot
Guessing Revisited: A Large Deviations Approach
inferred← citeshttps://doi.org/10.11650/twjm/1500405793openalex-snapshot
ON A NON-COMPACT GENERALIZATION OF FAN'S MINIMAX THEOREM
inferred← citeshttps://doi.org/10.37070/aml.2023.40.1.01openalex-snapshot
Kassay Gábor tudományos tevékenységéről
inferred← citeshttps://doi.org/10.48550/arxiv.1008.1977openalex-snapshot
Guessing Revisited: A Large Deviations Approach
inferred← citeshttps://doi.org/10.68381/jca09004openalex-snapshot
Separation Theorems for Abstract Convex Structures
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.