On the public citation graph

Monotonic Stable Solutions for Minimum Coloring Games

0 signed · 18 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/978-3-540-24587-2_70openalex-extracted

Fair Cost Allocations under Conflicts — A Game-Theoretic Point of View —

inferredcites →https://doi.org/10.1007/bf01585702openalex-extracted

Traveling salesman games

inferredcites →https://doi.org/10.1007/bf01681356openalex-extracted

On the core of linear production games

inferredcites →https://doi.org/10.1007/bf02579075openalex-extracted

Operations research games: A survey

inferredcites →https://doi.org/10.1007/s001860300284openalex-extracted

Submodularity of some classes of the combinatorial optimization games

inferredcites →https://doi.org/10.1007/s101070050005openalex-extracted

Totally balanced combinatorial optimization games

inferredcites →https://doi.org/10.1007/s101070050093openalex-extracted

On some balanced, totally balanced and submodular delivery games

inferredcites →https://doi.org/10.1016/0166-218x(96)00094-7openalex-extracted

Quasi-threshold graphs

inferredcites →https://doi.org/10.1016/0377-2217(89)90427-xopenalex-extracted

Sequencing games

inferredcites →https://doi.org/10.1016/0899-8256(90)90006-gopenalex-extracted

Population monotonic allocation schemes for cooperative games with transferable utility

inferredcites →https://doi.org/10.1016/j.geb.2007.02.003openalex-extracted

Production-inventory games: A new class of totally balanced combinatorial optimization games

inferredcites →https://doi.org/10.1090/s0002-9939-1962-0172273-0openalex-extracted

The Comparability Graph of a Tree

inferredcites →https://doi.org/10.1090/s0002-9939-1965-0172274-5openalex-extracted

A Note on "The Comparability Graph of a Tree"

inferredcites →https://doi.org/10.1090/s0002-9939-1995-1260169-4openalex-extracted

Characterizations of naturally submodular graphs: a polynomially solvable class of the TSP

inferredcites →https://doi.org/10.1287/moor.1060.0187openalex-extracted

Core Stability of Minimum Coloring Games

inferredcites →https://doi.org/10.1287/moor.24.3.751openalex-extracted

Algorithmic Aspects of the Core of Combinatorial Optimization Games

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.2205694openalex-extracted

inferred← citeshttps://doi.org/10.1016/j.dam.2014.03.002openalex-snapshot

Graphs Inducing Totally Balanced and Submodular Chinese Postman Games

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.