On the public citation graph

A lower bound on computational complexity given by revelation mechanisms

https://doi.org/10.1007/bf01213904
0 signed · 32 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-0-387-28929-8_4openalex-snapshot
Lie Algebras and lie Groups
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/978-1-4615-2261-4_6openalex-snapshot
An Axiomatic Characterization of the Price Mechanism
inferredcites →https://doi.org/10.1007/978-1-4615-7904-5openalex-snapshot
Stable Mappings and Their Singularities
inferredcites →https://doi.org/10.1007/978-3-540-70634-2openalex-snapshot
Lie Algebras and Lie Groups: 1964 Lectures given at Harvard University
inferredcites →https://doi.org/10.1007/978-94-017-9427-5_2openalex-snapshot
Decisions and Organizations
inferredcites →https://doi.org/10.1016/0022-0531(82)90088-6openalex-snapshot
The competitive allocation process is informationally efficient uniquely
inferredcites →https://doi.org/10.1016/0022-0531(84)90066-8openalex-snapshot
A note on allocations attainable through nash equilibria
inferredcites →https://doi.org/10.1016/0022-0531(84)90160-1openalex-snapshot
Incentive compatibility and informational requirements
inferredcites →https://doi.org/10.1016/0022-0531(85)90065-1openalex-snapshot
Necessary and sufficient conditions for the existence of a locally stable message process
inferredcites →https://doi.org/10.1016/0022-0531(86)90021-9openalex-snapshot
Finite automata play the repeated prisoner's dilemma
inferredcites →https://doi.org/10.1016/0022-0531(92)90089-zopenalex-snapshot
Decentralized dynamic processes for finding equilibrium
inferredcites →https://doi.org/10.1016/0165-1765(85)90026-6openalex-snapshot
Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
inferredcites →https://doi.org/10.1016/0304-4068(92)90004-qopenalex-snapshot
A lower bound for the dimension of the message space of the decentralized mechanisms realizing a given goal
inferredcites →https://doi.org/10.1073/pnas.91.15.7169openalex-snapshot
A decentralized process for finding equilibria given by linear equations.
inferredcites →https://doi.org/10.1090/s0002-9904-1947-08796-6openalex-snapshot
A note on the interrelation of subsets of independent variables of a continuous function with continuous first derivatives
inferredcites →https://doi.org/10.1145/322186.322200openalex-snapshot
Lower Bounds on Information Transfer in Distributed Computations
inferredcites →https://doi.org/10.2307/1911078openalex-snapshot
Finite Rationality and Interpersonal Complexity in Repeated Games
inferredcites →https://doi.org/10.2307/1911438openalex-snapshot
Effective Price Mechanisms
inferredcites →https://doi.org/10.2307/1911705openalex-snapshot
Game Forms with Minimal Message Spaces
inferredcites →https://doi.org/10.2307/1911782openalex-snapshot
An Axiomatic Characterization of the Price Mechanism
inferredcites →https://doi.org/10.2307/2004866openalex-snapshot
Theories of Abstract Automata

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.3802451openalex-extracted
Simple Social Choice Rules for Exchange
inferred← citeshttps://doi.org/10.1007/978-3-662-05611-0_23openalex-snapshot
Mechanism Design without Games
inferred← citeshttps://doi.org/10.1007/s10058-021-00282-3openalex-snapshot
Computational implementation
inferred← citeshttps://doi.org/10.1007/s100580050007openalex-snapshot
The scheduling and organization of periodic associative computation: Efficient networks
inferred← citeshttps://doi.org/10.1016/s1574-0145(06)01004-xopenalex-snapshot
Chapter 4 Organization Structure
inferred← citeshttps://doi.org/10.1111/1467-937x.00101openalex-snapshot
Real-Time Decentralized Information Processing as a Model of Organizations with Boundedly Rational Agents
inferred← citeshttps://doi.org/10.1111/j.1430-9134.1997.00639.xopenalex-snapshot
Experiments Testing Multiobject Allocation Mechanisms
inferred← citeshttps://doi.org/10.1142/9789814699556_0013openalex-snapshot
Computational Implementation
inferred← citeshttps://doi.org/10.1201/b14075-16openalex-snapshot
A Computational Implementation
inferred← citeshttps://doi.org/10.7907/6ehr5-jww49openalex-snapshot
The Results of Some Tests of Mechanism Designs for the Allocation and Pricing of Collections of Heterogeneous Items
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.