On the public citation graph
Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing
0 signed · 76 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
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/11944874_32openalex-snapshot
Mixed Strategies in Combinatorial Agency
inferredcites →https://doi.org/10.1007/3-540-45353-9_31openalex-snapshot
Uncheatable Distributed Computations
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/978-3-540-74466-5_40openalex-snapshot
Characterizing Result Errors in Internet Desktop Grids
inferredcites →https://doi.org/10.1007/978-3-540-93980-1_10openalex-snapshot
Malicious Bayesian Congestion Games
inferredcites →https://doi.org/10.1007/978-3-642-04128-0_16openalex-snapshot
Altruism in Atomic Congestion Games
inferredcites →https://doi.org/10.1007/978-3-642-04645-2_11openalex-snapshot
Free-Riding and Free-Labor in Combinatorial Agency
inferredcites →https://doi.org/10.1007/978-3-642-13284-1_3openalex-snapshot
Towards Network Games with Social Preferences
inferredcites →https://doi.org/10.1007/bf01737559openalex-snapshot
A class of games possessing pure-strategy Nash equilibria
inferredcites →https://doi.org/10.1007/s00453-006-0056-1openalex-snapshot
The Price of Selfish Routing
inferredcites →https://doi.org/10.1007/s10723-009-9126-3openalex-snapshot
Performance Prediction and Analysis of BOINC Projects: An Empirical Study with EmBOINC
inferredcites →https://doi.org/10.1007/s10723-009-9131-6openalex-snapshot
Computing Low Latency Batches with Unreliable Workers in Volunteer Computing Environments
inferredcites →https://doi.org/10.1007/springerreference_60360openalex-snapshot
Evolutionary Game Theory
inferredcites →https://doi.org/10.1016/0014-2921(94)90121-xopenalex-snapshot
Evolutionary game theory
inferredcites →https://doi.org/10.1016/s0167-739x(01)00077-2openalex-snapshot
Sabotage-tolerance mechanisms for volunteer computing systems
inferredcites →https://doi.org/10.1017/cbo9781139173179openalex-snapshot
Evolutionary Games and Population Dynamics
inferredcites →https://doi.org/10.1073/pnas.36.1.48openalex-snapshot
Equilibrium points in n -person games
inferredcites →https://doi.org/10.1098/rstl.1819.0023openalex-snapshot
XXI. A new method of solving numerical equations of all orders, by continuous approximation
inferredcites →https://doi.org/10.1109/5992.895191openalex-snapshot
SETI@home-massively distributed computing for SETI
inferredcites →https://doi.org/10.1109/gamenets.2009.5137423openalex-snapshot
Combinatorial agency with audits
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/icdcs.2004.1281562openalex-snapshot
Uncheatable grid computing
inferredcites →https://doi.org/10.1109/ipdps.2002.1015590openalex-snapshot
Models and scheduling mechanisms for global computing applications
inferredcites →https://doi.org/10.1109/ipdps.2005.247openalex-snapshot
Homogeneous Redundancy: a Technique to Ensure Integrity of Molecular Simulation Results Using Public Computing
inferredcites →https://doi.org/10.1109/ipdps.2006.1639285openalex-snapshot
An authentication protocol in Web-computing
inferredcites →https://doi.org/10.1109/ipdps.2008.4536244openalex-snapshot
Distributed asymmetric verification in computational grids
inferredcites →https://doi.org/10.1109/nca.2008.41openalex-snapshot
Designing Mechanisms for Reliable Internet-based Computing
inferredcites →https://doi.org/10.1109/srds.2006.40openalex-snapshot
Reliably Executing Tasks in the Presence of Untrusted Entities
inferredcites →https://doi.org/10.1111/1467-937x.t01-1-00023openalex-snapshot
Fault Tolerant Implementation
inferredcites →https://doi.org/10.1142/s0219198901000348openalex-snapshot
ASPIRATION-BASED REINFORCEMENT LEARNING IN REPEATED INTERACTION GAMES: AN OVERVIEW
inferredcites →https://doi.org/10.1145/1007352.1007447openalex-snapshot
Rational secret sharing and multiparty computation
inferredcites →https://doi.org/10.1145/1095809.1095816openalex-snapshot
BAR fault tolerance for cooperative services
inferredcites →https://doi.org/10.1145/1095810.1095816openalex-snapshot
BAR fault tolerance for cooperative services
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.1146393openalex-snapshot
Distributed computing meets game theory
inferredcites →https://doi.org/10.1145/1998037.1998055openalex-snapshot
Distributed computing meets game theory
inferredcites →https://doi.org/10.1287/mnsc.1040.0270openalex-snapshot
Games with Incomplete Information Played by “Bayesian” Players, I–III: Part I. The Basic Model
inferredcites →https://doi.org/10.1287/mnsc.14.3.159openalex-snapshot
Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
inferredcites →https://doi.org/10.1287/mnsc.14.5.320openalex-snapshot
Games with Incomplete Information Played by “Bayesian” Players Part II. Bayesian Equilibrium Points
inferredcites →https://doi.org/10.2307/j.ctv173f1fh.20openalex-snapshot
GAMES WITH INCOMPLETE INFORMATION PLAYED BY “BAYESIAN” PLAYERS
inferredcites →https://doi.org/10.4135/9781452275567.n5openalex-snapshot
An Introduction to Game Theory
inferredcites →https://doi.org/10.48550/arxiv.1307.1650openalex-snapshot
Algorithmic Mechanisms for Reliable Internet-based Computing under Collusion
inferredcites →https://doi.org/10.48550/arxiv.cs/0703148openalex-snapshot
Computer Science and Game Theory: A Brief Survey
inferredcites →https://doi.org/10.5555/1283383.1283402openalex-snapshot
Convergence to approximate Nash equilibria in congestion games
inferredcites →https://doi.org/10.5555/1855741.1855766openalex-snapshot
FlightPath: obedience vs. choice in cooperative services
inferredcites →https://doi.org/10.5555/1898953.1898981openalex-snapshot
An authentication protocol in Web-computing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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-46140-3_11openalex-snapshot
Internet Computing: Using Reputation to Select Workers from a Pool
inferred← citeshttps://doi.org/10.1007/978-3-319-78078-8_24openalex-snapshot
Classification-Based Reputation Mechanism for Master-Worker Computing System
inferred← citeshttps://doi.org/10.1007/s10723-019-09497-9openalex-snapshot
BOINC: A Platform for Volunteer Computing
inferred← citeshttps://doi.org/10.1007/s11235-018-0481-xopenalex-snapshot
Collaborative handshaking approaches between internet of computing and internet of things towards a smart world: a review from 2009–2017
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.10.002openalex-snapshot
Robust network supercomputing with unreliable workers
inferred← citeshttps://doi.org/10.1016/j.pmcj.2018.10.001openalex-snapshot
Reputation-based multi-auditing algorithmic mechanism for reliable mobile crowdsensing
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114631openalex-snapshot
Verifiable Crowd Computing: Coping with bounded rationality
inferred← citeshttps://doi.org/10.1109/cic.2015.30openalex-snapshot
Analyzing Reliability in Hybrid Compute Units
inferred← citeshttps://doi.org/10.1109/srds.2016.015openalex-snapshot
Multi-round Master-Worker Computing: A Repeated Game Approach
inferred← citeshttps://doi.org/10.1145/3796701.3815939openalex-snapshot
Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial 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.