On the public citation graph

A Simple Algorithm for the Nucleolus of Airport Profit Games

https://doi.org/10.1007/s00182-006-0019-4
0 signed · 35 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.3800120303openalex-snapshot
The kernel of a cooperative game
inferredcites →https://doi.org/10.1006/game.1997.0601openalex-snapshot
A Characterization of the Nucleolus for Convex Games
inferredcites →https://doi.org/10.1007/bf01753311openalex-snapshot
A further note on the nucleoous of the “airport game”
inferredcites →https://doi.org/10.1007/bf01766216openalex-snapshot
A simple expression for the nucleolus in a special case
inferredcites →https://doi.org/10.1016/s0165-4896(99)00004-9openalex-snapshot
Airport problems and consistent allocation rules
inferredcites →https://doi.org/10.1017/cbo9780511528446.003openalex-snapshot
A value for n -person games
inferredcites →https://doi.org/10.1137/0117107openalex-snapshot
The Nucleolus of a Characteristic Function Game
inferredcites →https://doi.org/10.1287/mnsc.20.3.370openalex-snapshot
A Simple Expression for the Shapley Value in a Special Case
inferredcites →https://doi.org/10.1287/mnsc.28.8.869openalex-snapshot
The Shapley Value as Aircraft Landing Fees–Revisited
inferredcites →https://doi.org/10.2307/3003493openalex-snapshot
Aircraft Landing Fees: A Game Theory Approach

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.2154836openalex-extracted
On the Core of Cost-Revenue Games: Minimum Cost Spanning Tree Games with Revenues
inferred← citeshttps://doi.org/10.2139/ssrn.2323322openalex-extracted
Cost Sharing in Chains and Other Fixed Trees
inferred← citeshttps://doi.org/10.2139/ssrn.627424openalex-extracted
Cases in Cooperation and Cutting the Cake
inferred← citeshttps://doi.org/10.2139/ssrn.905483openalex-extracted
inferred← citeshttps://doi.org/10.1007/978-3-030-57980-7_20openalex-snapshot
A General Framework for Computing the Nucleolus via Dynamic Programming
inferred← citeshttps://doi.org/10.1007/s00182-009-0154-9openalex-snapshot
On the core of routing games with revenues
inferred← citeshttps://doi.org/10.1007/s00182-025-00963-1openalex-snapshot
Cooperative game theoretic results from the tuna fishing problem
inferred← citeshttps://doi.org/10.1007/s10107-021-01752-wopenalex-snapshot
Arboricity games: the core and the nucleolus
inferred← citeshttps://doi.org/10.1007/s10479-015-1981-7openalex-snapshot
A non-cooperative mechanism for the Shapley value of airport problems
inferred← citeshttps://doi.org/10.1007/s10726-017-9551-9openalex-snapshot
A Non-cooperative Mechanism Yielding the Nucleolus of Airport Problems
inferred← citeshttps://doi.org/10.1016/j.cor.2019.104764openalex-snapshot
A heuristic procedure for computing the nucleolus
inferred← citeshttps://doi.org/10.1016/j.econlet.2009.12.033openalex-snapshot
An axiomatic characterization of the Baker-Thompson rule
inferred← citeshttps://doi.org/10.1016/j.econlet.2012.05.014openalex-snapshot
Cooperative models for allocating an object
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.01.056openalex-snapshot
On the core of cost-revenue games: Minimum cost spanning tree games with revenues
inferred← citeshttps://doi.org/10.1016/j.geb.2017.04.007openalex-snapshot
A note on the Shapley value for airport cost pooling game
inferred← citeshttps://doi.org/10.1016/j.geb.2023.09.009openalex-snapshot
Sharing Cost of Network Among Users with Differentiated Willingness to Pay
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2024.03.007openalex-snapshot
Cost allocation and airport problems
inferred← citeshttps://doi.org/10.1016/j.orl.2014.12.005openalex-snapshot
The nucleolus of arborescence games in directed acyclic graphs
inferred← citeshttps://doi.org/10.1142/s0219198913400197openalex-snapshot
AN OVERVIEW ON GAME THEORY APPLICATIONS TO ENGINEERING
inferred← citeshttps://doi.org/10.1145/2692372.2692374openalex-snapshot
The Complexity of the Nucleolus in Compact Games
inferred← citeshttps://doi.org/10.1145/3580375openalex-snapshot
A Framework for Computing the Nucleolus via Dynamic Programming
inferred← citeshttps://doi.org/10.1515/rle-2016-0001openalex-snapshot
A Law-and-Economics Perspective on Cost-Sharing Rules for a Condo Elevator
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8242openalex-snapshot
Computing the Nucleolus of Matching, Cover and Clique Games
inferred← citeshttps://doi.org/10.3917/reco.712.0225openalex-snapshot
The Nucleolus, the Kernel, and the Bargaining Set: An Update
inferred← citeshttps://doi.org/10.48550/arxiv.2005.10853openalex-snapshot
A General Framework for Computing the Nucleolus Via Dynamic Programming
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.