On the public citation graph

How a genetic algorithm learns to play Traveler's Dilemma by choosing dominated strategies to achieve greater payoffs

https://doi.org/10.1109/cig.2009.5286474
0 signed · 20 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-1-4684-9393-1openalex-snapshot
Feynman-Kac Formulae
inferredcites →https://doi.org/10.1007/978-3-662-02830-8openalex-snapshot
Genetic Algorithms + Data Structures = Evolution Programs
inferredcites →https://doi.org/10.1007/978-3-662-03315-9openalex-snapshot
Genetic Algorithms + Data Structures = Evolution Programs
inferredcites →https://doi.org/10.1038/scientificamerican0607-90openalex-snapshot
The Traveler's Dilemma
inferredcites →https://doi.org/10.1109/isda.2005.38openalex-snapshot
Discovering effective strategies for the iterated prisoner's dilemma using genetic algorithms
inferredcites →https://doi.org/10.1111/j.1468-0297.2007.02081.xopenalex-snapshot
Instinctive and Cognitive Reasoning: A Study of Response Times
inferredcites →https://doi.org/10.1198/jasa.2005.s52openalex-snapshot
Feynman–Kac Formulae: Genealogical and Interacting Particle Systems with Applications
inferredcites →https://doi.org/10.1257/aer.89.3.678openalex-snapshot
Anomalous Behavior in a Traveler's Dilemma?
inferredcites →https://doi.org/10.15517/rmta.v8i2.201openalex-snapshot
Modeling genetic algorithms with interacting particle systems

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.3432903openalex-extracted
inferred← citeshttps://doi.org/10.1007/978-3-030-01174-1_79openalex-snapshot
Individual Rationality and Real-World Strategic Interactions: Understanding the Competitive-Cooperative Spectrum
inferred← citeshttps://doi.org/10.1007/978-3-642-23620-4_32openalex-snapshot
How to Play Well in Non-zero Sum Games: Some Lessons from Generalized Traveler’s Dilemma
inferred← citeshttps://doi.org/10.1007/978-3-658-39694-7_2openalex-snapshot
Eine kurze Geschichte von Law and Economics
inferred← citeshttps://doi.org/10.1007/978-3-658-39694-7_7openalex-snapshot
Rationalität, Recht, Legitimität
inferred← citeshttps://doi.org/10.1016/j.jebo.2021.02.027openalex-snapshot
Cold play: Learning across bimatrix games
inferred← citeshttps://doi.org/10.1080/0305215x.2021.1957861openalex-snapshot
Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players
inferred← citeshttps://doi.org/10.1109/wi-iat.2012.266openalex-snapshot
On Finding and Learning Effective Strategies for Complex Non-zero-sum Repeated Games
inferred← citeshttps://doi.org/10.1109/wi.2016.0120openalex-snapshot
On Learning and Co-learning Effective Strategies in Iterated Travelers' Dilemma
inferred← citeshttps://doi.org/10.1162/evco_a_00308openalex-snapshot
Regret-Based Nash Equilibrium Sorting Genetic Algorithm for Combinatorial Game Theory Problems with Multiple Players
inferred← citeshttps://doi.org/10.5220/0003753900720082openalex-snapshot
STRATEGIES FOR CHALLENGING TWO-PLAYER GAMES - Some Lessons from Iterated Traveler’s Dilemma
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.