On the public citation graph

On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints

0 signed · 49 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.1002/nav.3800060406openalex-snapshot
A matrix algorithm for solutions and r‐bases of a finite irreflexive relation
inferredcites →https://doi.org/10.1002/nav.3800070202openalex-snapshot
Definitions for a theory of games and pursuit
inferredcites →https://doi.org/10.1002/nav.3800250215openalex-snapshot
A note concerning asymmetric games on graphs
inferredcites →https://doi.org/10.1002/net.3230070306openalex-snapshot
On kernels in strongly connected graphs
inferredcites →https://doi.org/10.1007/bf01085396openalex-snapshot
Generalization of a kernel of a graph
inferredcites →https://doi.org/10.1007/bf01448847openalex-snapshot
Zur Theorie der Gesellschaftsspiele
inferredcites →https://doi.org/10.1007/bf02488022openalex-snapshot
An extension and simple proof of a constrained lattice fixed point theorem
inferredcites →https://doi.org/10.1007/bfb0066192openalex-snapshot
Every directed graph has a semi-kernel
inferredcites →https://doi.org/10.1016/0012-365x(77)90033-4openalex-snapshot
Analyzing games by Boolean matrix iteration
inferredcites →https://doi.org/10.1016/0012-365x(77)90057-7openalex-snapshot
Quasi-kernels of minimum weakness in a graph
inferredcites →https://doi.org/10.1016/0012-365x(81)90264-8openalex-snapshot
A note on kernel-critical graphs
inferredcites →https://doi.org/10.1016/0012-365x(82)90087-5openalex-snapshot
A counterexample to a conjecture of meyniel on kernel-perfect graphs
inferredcites →https://doi.org/10.1016/0012-365x(83)90017-1openalex-snapshot
Une generalisation du theoreme de Richardson sur l'existence de noyaux dans les graphes orientes
inferredcites →https://doi.org/10.1016/0095-8956(78)90026-6openalex-snapshot
Two-person games on graphs
inferredcites →https://doi.org/10.1016/0166-218x(81)90003-2openalex-snapshot
Planar kernel and grundy with d≤3, dout≤2, din≤2 are NP-complete
inferredcites →https://doi.org/10.1016/b978-0-12-398050-2.50014-1openalex-snapshot
A Fixed Point Approach to Stability in Cooperative Games
inferredcites →https://doi.org/10.1016/s0021-9800(66)80005-4openalex-snapshot
Graphs and composite games
inferredcites →https://doi.org/10.1016/s0167-5060(08)70041-4openalex-snapshot
Graphes Noyau-Parfaits
inferredcites →https://doi.org/10.1017/s0305004100031509openalex-snapshot
The G -values of various games
inferredcites →https://doi.org/10.1017/s0305004100031510openalex-snapshot
Disjunctive games with the last player losing
inferredcites →https://doi.org/10.1073/pnas.39.7.649openalex-snapshot
Extension Theorems for Solutions of Irreflexive Relations
inferredcites →https://doi.org/10.1090/s0002-9904-1946-08518-3openalex-snapshot
On weakly ordered systems
inferredcites →https://doi.org/10.1090/s0002-9904-1975-13672-xopenalex-snapshot
A lattice fixed-point theorem with constraints
inferredcites →https://doi.org/10.1090/s0002-9939-1963-0144328-9openalex-snapshot
On a problem of C. Berge
inferredcites →https://doi.org/10.1093/comjnl/21.1.94openalex-snapshot
Advances in computer chess
inferredcites →https://doi.org/10.1287/moor.1.1.43openalex-snapshot
Subsolutions and the Supercore of Cooperative Games
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications
inferredcites →https://doi.org/10.2140/pjm.1955.5.551openalex-snapshot
Relativization and extension of solutions of irreflexive relations
inferredcites →https://doi.org/10.2307/1232672openalex-snapshot
The Theory of Games and Economic Behavior
inferredcites →https://doi.org/10.2307/1967631openalex-snapshot
Nim, A Game with a Complete Mathematical Theory

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_42openalex-snapshot
Boolean and Fuzzy Relations
inferred← citeshttps://doi.org/10.1007/3-540-58233-9_4openalex-snapshot
Prototyping relational specifications using higher-order objects
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_53openalex-snapshot
Boolean and Fuzzy Relations
inferred← citeshttps://doi.org/10.1007/978-3-030-90928-4_17openalex-snapshot
On Computing Digraph Kernels
inferred← citeshttps://doi.org/10.1007/978-3-319-24704-5_7openalex-snapshot
Relations among Matrices over a Semiring
inferred← citeshttps://doi.org/10.1007/978-3-642-77968-8_8openalex-snapshot
Kernels and Games
inferred← citeshttps://doi.org/10.1007/978-3-642-83608-4_8openalex-snapshot
Kerne und Spiele
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90365-oopenalex-snapshot
Bibliography on domination in graphs and some basic definitions of domination parameters
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.05.004openalex-snapshot
Choices and kernels in bipolar valued digraphs
inferred← citeshttps://doi.org/10.1016/j.entcs.2003.05.006openalex-snapshot
A–maze–ing Esterel
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00035-5openalex-snapshot
Computing kernels in directed bichromatic graphs
inferred← citeshttps://doi.org/10.1016/s0165-0114(97)00064-xopenalex-snapshot
On fuzzification of some concepts of graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)71054-9openalex-snapshot
Bibliography on Domination in Graphs and Some Basic Definitions of Domination Parameters
inferred← citeshttps://doi.org/10.1016/s0167-6423(99)00043-xopenalex-snapshot
Deriving relational programs for computing kernels by reconstructing a proof of Richardson's theorem
inferred← citeshttps://doi.org/10.1017/9781316135167.033openalex-snapshot
Combinatorial Games: Selected Bibliography With A Succinct Gourmet Introduction
inferred← citeshttps://doi.org/10.1023/a:1006463732291openalex-snapshot
Games, Kernels, and Antitone Operations
inferred← citeshttps://doi.org/10.1142/s0219198923500111openalex-snapshot
Revealed VNM-Solutions: Characterizations
inferred← citeshttps://doi.org/10.3233/icg-200151openalex-snapshot
CEN: Thomas Ströhlein’s Endgame Tables, a 50 th Anniversary
inferred← citeshttps://doi.org/10.3390/g16020017openalex-snapshot
Von Neumann–Morgenstern Hypergraphs
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.