On the public citation graph

A symmetric minimax theorem without linear structure

0 signed · 27 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/bf01220380openalex-snapshot
Bemerkungen zum von Neumannschen Minimaxtheorem
inferredcites →https://doi.org/10.1007/bf01448847openalex-snapshot
Zur Theorie der Gesellschaftsspiele
inferredcites →https://doi.org/10.1007/bf01898769openalex-snapshot
Über das von Neumannsche Minimax-Theorem
inferredcites →https://doi.org/10.1073/pnas.39.1.42openalex-snapshot
Minimax Theorems
inferredcites →https://doi.org/10.1080/03081088508817653openalex-snapshot
Minimax theorems without linear structure
inferredcites →https://doi.org/10.1090/conm/052/840699openalex-snapshot
Minimax theorems without convexity

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jmaa.2001.7678openalex-snapshot
Alternative and Minimax Theorems beyond Vector Spaces
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-94-015-9113-3_1openalex-snapshot
Nonlinear Two Functions Minimax Theorems
inferred← citeshttps://doi.org/10.1007/978-94-015-9113-3_2openalex-snapshot
Weakly Upward-Downward Minimax Theorem
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/bf01190004openalex-snapshot
Minimax theorems with staircases
inferred← citeshttps://doi.org/10.1007/bf01191168openalex-snapshot
An upward-downward minimax theorem
inferred← citeshttps://doi.org/10.1007/bf01191693openalex-snapshot
On a minimax theorem of Terkelsen's
inferred← citeshttps://doi.org/10.1007/bf01200042openalex-snapshot
A two functions symmetric nonlinear minimax theorem
inferred← citeshttps://doi.org/10.1007/bf01874580openalex-snapshot
Minimax theorems with one-sided randomization
inferred← citeshttps://doi.org/10.1007/bf01874944openalex-snapshot
A flexible minimax theorem
inferred← citeshttps://doi.org/10.1007/s10114-005-0836-6openalex-snapshot
The Minimax Equality; Sufficient and Necessary Conditions
inferred← citeshttps://doi.org/10.1016/j.jmaa.2004.04.002openalex-snapshot
Two-function upward–downward minimax theorems
inferred← citeshttps://doi.org/10.1023/a:1006671721304openalex-snapshot
A Two Function Metaminimax Theorem
inferred← citeshttps://doi.org/10.1023/a:1022679504350openalex-snapshot
New Saddle Point Theorem Beyond Topological Vector Spaces
inferred← citeshttps://doi.org/10.11650/tjm.13.2009.541openalex-snapshot
SOME GENERALIZED KY FAN’S INEQUALITIES
inferred← citeshttps://doi.org/10.11650/tjm.5.2001.1250openalex-snapshot
A MINIMAX THEOREM INVOLVING TWO FUNCTIONS
inferred← citeshttps://doi.org/10.11650/twjm/1500405281openalex-snapshot
SOME GENERALIZED KY FAN’S INEQUALITIES
inferred← citeshttps://doi.org/10.11650/twjm/1500574957openalex-snapshot
A MINIMAX THEOREM INVOLVING TWO FUNCTIONS
inferred← citeshttps://doi.org/10.1515/jaa.1999.59openalex-snapshot
On Minimax Inequality and Generalized Quasi–Variational Inequality in H-Spaces
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.