On the public citation graph

Computational implementation

https://doi.org/10.1007/s10058-021-00282-3
0 signed · 37 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/bf00303168openalex-snapshot
Game forms for Nash implementation of general social choice correspondences
inferredcites →https://doi.org/10.1007/bf01213904openalex-snapshot
A lower bound on computational complexity given by revelation mechanisms
inferredcites →https://doi.org/10.1007/s00199-023-01494-0openalex-snapshot
Behavioral Strong Implementation
inferredcites →https://doi.org/10.1007/s00355-014-0835-6openalex-snapshot
Maskin-monotonic scoring rules
inferredcites →https://doi.org/10.1007/s00355-020-01293-9openalex-snapshot
On the subgame perfect implementability of voting rules
inferredcites →https://doi.org/10.1007/s003550100152openalex-snapshot
A crash course in implementation theory
inferredcites →https://doi.org/10.1007/s11238-011-9251-xopenalex-snapshot
Implementation without rationality assumptions
inferredcites →https://doi.org/10.1016/0022-0531(74)90012-xopenalex-snapshot
The informational size of message spaces
inferredcites →https://doi.org/10.1016/0022-0531(84)90089-9openalex-snapshot
A method for constructing message systems for smooth performance functions
inferredcites →https://doi.org/10.1016/j.econlet.2007.07.016openalex-snapshot
Nash implementability of the plurality rule over restricted domains
inferredcites →https://doi.org/10.1016/j.jet.2004.10.007openalex-snapshot
The communication requirements of efficient allocations and supporting prices
inferredcites →https://doi.org/10.1016/j.jet.2006.09.011openalex-snapshot
The communication requirements of social choice rules and supporting budget sets
inferredcites →https://doi.org/10.1016/j.jet.2018.04.009openalex-snapshot
Implementation via rights structures
inferredcites →https://doi.org/10.1016/j.jet.2021.105261openalex-snapshot
A solution to the two-person implementation problem
inferredcites →https://doi.org/10.1016/j.jet.2023.105738openalex-snapshot
Behavioral implementation under incomplete information
inferredcites →https://doi.org/10.1016/j.mathsocsci.2022.12.002openalex-snapshot
Implementation with a sympathizer
inferredcites →https://doi.org/10.1016/s1574-0110(02)80009-1openalex-snapshot
Chapter 5 Implementation theory
inferredcites →https://doi.org/10.1017/cbo9780511754241openalex-snapshot
Computation and Complexity in Economic Behavior and Organization
inferredcites →https://doi.org/10.1017/cbo9780511754258openalex-snapshot
Designing Economic Mechanisms
inferredcites →https://doi.org/10.1109/mis.2003.1249168openalex-snapshot
Computational-mechanism design: a call to arms
inferredcites →https://doi.org/10.1111/1467-937x.00076openalex-snapshot
Nash Equilibrium and Welfare Optimality
inferredcites →https://doi.org/10.1137/s0036144503435945openalex-snapshot
The Theory of Implementation of Social Choice Rules
inferredcites →https://doi.org/10.1257/aer.104.10.2975openalex-snapshot
Behavioral Implementation
inferredcites →https://doi.org/10.1257/aer.20160425openalex-snapshot
Obviously Strategy-Proof Mechanisms
inferredcites →https://doi.org/10.2307/1911705openalex-snapshot
Game Forms with Minimal Message Spaces
inferredcites →https://doi.org/10.2307/1911706openalex-snapshot
Strategy Space Reduction in Maskin's Theorem: Sufficient Conditions for Nash Implementation
inferredcites →https://doi.org/10.2307/1914162openalex-snapshot
Realization and Nash Implementation: Two Aspects of Mechanism Design
inferredcites →https://doi.org/10.2307/2298049openalex-snapshot
A Necessary and Sufficient Condition for Two-Person Nash Implementation
inferredcites →https://doi.org/10.2307/2938301openalex-snapshot
Nash Implementation: A Full Characterization
inferredcites →https://doi.org/10.3982/ecta15897openalex-snapshot
Strategically Simple Mechanisms
inferredcites →https://doi.org/10.3982/te576openalex-snapshot
Nash implementation with little communication

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.4691849openalex-extracted
Behavioral Implementation By Individual Rights Structures: A Full Characterization
inferred← citeshttps://doi.org/10.1007/s00355-025-01635-5openalex-snapshot
Anonymous implementation
inferred← citeshttps://doi.org/10.1016/j.jebo.2025.107367openalex-snapshot
Behavioral implementation by individual-based rights structures: A full characterization
inferred← citeshttps://doi.org/10.1016/j.jet.2023.105738openalex-snapshot
Behavioral implementation under incomplete information
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2022.12.002openalex-snapshot
Implementation with a sympathizer
inferred← citeshttps://doi.org/10.2139/ssrn.7226298openalex-snapshot
Maskin's two-person impossibility without rationality
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.