On the public citation graph

Designing Mechanisms for Reliable Internet-based Computing

0 signed · 40 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.1006/game.1999.0790openalex-snapshot
Algorithmic Mechanism Design
inferredcites →https://doi.org/10.1007/11672142_50openalex-snapshot
Memoryless Facility Location in One Pass
inferredcites →https://doi.org/10.1007/11864219_33openalex-snapshot
Robust Network Supercomputing with Malicious Processes
inferredcites →https://doi.org/10.1007/3-540-45353-9_31openalex-snapshot
Uncheatable Distributed Computations
inferredcites →https://doi.org/10.1007/3-540-45748-8_24openalex-snapshot
The Sybil Attack
inferredcites →https://doi.org/10.1007/3-540-46088-8_23openalex-snapshot
Secure Distributed Computing in a Commercial Environment
inferredcites →https://doi.org/10.1007/3-540-49116-3_38openalex-snapshot
Worst-Case Equilibria
inferredcites →https://doi.org/10.1007/978-3-540-45172-3_11openalex-snapshot
On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing
inferredcites →https://doi.org/10.1007/978-3-540-45172-3_13openalex-snapshot
Rationality and Self-Interest in Peer to Peer Networks
inferredcites →https://doi.org/10.1007/s00446-005-0122-yopenalex-snapshot
A BGP-based mechanism for lowest-cost routing
inferredcites →https://doi.org/10.1007/s00453-006-0056-1openalex-snapshot
The Price of Selfish Routing
inferredcites →https://doi.org/10.1073/pnas.36.1.48openalex-snapshot
Equilibrium points in n -person games
inferredcites →https://doi.org/10.1109/5992.895191openalex-snapshot
SETI@home-massively distributed computing for SETI
inferredcites →https://doi.org/10.1109/grid.2004.14openalex-snapshot
BOINC: A System for Public-Resource Computing and Storage
inferredcites →https://doi.org/10.1109/srds.2006.40openalex-snapshot
Reliably Executing Tasks in the Presence of Untrusted Entities
inferredcites →https://doi.org/10.1145/1007352.1007447openalex-snapshot
Rational secret sharing and multiparty computation
inferredcites →https://doi.org/10.1145/1011767.1011783openalex-snapshot
On spectrum sharing games
inferredcites →https://doi.org/10.1145/1067309.1067322openalex-snapshot
Algorithmic foundations of the internet
inferredcites →https://doi.org/10.1145/1102120.1102157openalex-snapshot
On the cost-ineffectiveness of redundancy in commercial P2P computing
inferredcites →https://doi.org/10.1145/1146381.1146391openalex-snapshot
When selfish meets evil
inferredcites →https://doi.org/10.1145/1146381.1146393openalex-snapshot
Distributed computing meets game theory
inferredcites →https://doi.org/10.1145/1282380.1282395openalex-snapshot
Lottery trees
inferredcites →https://doi.org/10.1145/506147.506153openalex-snapshot
How bad is selfish routing?
inferredcites →https://doi.org/10.48550/arxiv.cs/0703148openalex-snapshot
Computer Science and Game Theory: A Brief Survey

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.3104openalex-snapshot
Applying the dynamics of evolution to achieve reliability in master–worker computing
inferred← citeshttps://doi.org/10.1007/978-3-031-20796-9_5openalex-snapshot
Verifiable Crowd Computing: Coping with Bounded Rationality
inferred← citeshttps://doi.org/10.1007/978-3-319-03850-6_8openalex-snapshot
Reputation-Based Mechanisms for Evolutionary Master-Worker Computing
inferred← citeshttps://doi.org/10.1007/978-3-319-46140-3_11openalex-snapshot
Internet Computing: Using Reputation to Select Workers from a Pool
inferred← citeshttps://doi.org/10.1007/978-3-642-32820-6_45openalex-snapshot
Achieving Reliability in Master-Worker Computing via Evolutionary Dynamics
inferred← citeshttps://doi.org/10.1007/s10955-012-0661-0openalex-snapshot
Crowd Computing as a Cooperation Problem: An Evolutionary Approach
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114631openalex-snapshot
Verifiable Crowd Computing: Coping with bounded rationality
inferred← citeshttps://doi.org/10.1109/cyberc.2009.5342202openalex-snapshot
An improved staged event driven architecture for Master-Worker network computing
inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470409openalex-snapshot
Algorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workers
inferred← citeshttps://doi.org/10.1109/nca.2011.46openalex-snapshot
Algorithmic Mechanisms for Internet Supercomputing under Unreliable Communication
inferred← citeshttps://doi.org/10.1109/srds.2016.015openalex-snapshot
Multi-round Master-Worker Computing: A Repeated Game Approach
inferred← citeshttps://doi.org/10.1109/tc.2012.186openalex-snapshot
Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing
inferred← citeshttps://doi.org/10.1142/s0129626412500028openalex-snapshot
RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS
inferred← citeshttps://doi.org/10.1371/journal.pone.0116520openalex-snapshot
Algorithmic Mechanisms for Reliable Crowdsourcing Computation under Collusion
inferred← citeshttps://doi.org/10.48550/arxiv.1307.2783openalex-snapshot
Coping with Unreliable Workers in Internet-based Computing: An Evaluation of Reputation Mechanisms
inferred← citeshttps://doi.org/10.48550/arxiv.1603.04394openalex-snapshot
Internet Computing: Using Reputation to Select Workers from a Pool
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.