On the public citation graph

Selfish Multi-User Task Scheduling

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.1002/j.1538-7305.1966.tb01709.xopenalex-snapshot
Bounds for Certain Multiprocessing Anomalies
inferredcites →https://doi.org/10.1002/nav.3800030106openalex-snapshot
Various optimizers for single‐stage production
inferredcites →https://doi.org/10.1006/game.1999.0790openalex-snapshot
Algorithmic Mechanism Design
inferredcites →https://doi.org/10.1007/11600930_70openalex-snapshot
Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines
inferredcites →https://doi.org/10.1007/3-540-49116-3_38openalex-snapshot
Worst-Case Equilibria
inferredcites →https://doi.org/10.1007/978-3-540-24749-4_53openalex-snapshot
Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines
inferredcites →https://doi.org/10.1007/978-3-540-31856-9_6openalex-snapshot
Truthful Approximation Mechanisms for Scheduling Selfish Related Machines
inferredcites →https://doi.org/10.1007/bf01737559openalex-snapshot
A class of games possessing pure-strategy Nash equilibria
inferredcites →https://doi.org/10.1007/bf03325660openalex-snapshot
Introduction to game theory
inferredcites →https://doi.org/10.1016/j.tcs.2006.07.057openalex-snapshot
Truthful algorithms for scheduling selfish tasks on parallel machines
inferredcites →https://doi.org/10.1016/s0167-5060(08)70356-xopenalex-snapshot
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
inferredcites →https://doi.org/10.1109/ipdps.2006.1639548openalex-snapshot
A Strategyproof Mechanism for Scheduling Divisible Loads in Bus Networks without Control Processors
inferredcites →https://doi.org/10.1109/ispan.2005.37openalex-snapshot
Distributed Algorithmic Mechanism Design for Scheduling on Unrelated Machines
inferredcites →https://doi.org/10.1109/ispdc.2005.9openalex-snapshot
A Strategyproof Mechanism for Scheduling Divisible Loads in Distributed Systems
inferredcites →https://doi.org/10.1109/sfcs.2001.959924openalex-snapshot
Truthful mechanisms for one-parameter agents
inferredcites →https://doi.org/10.1137/0117039openalex-snapshot
Bounds on Multiprocessing Timing Anomalies
inferredcites →https://doi.org/10.1145/1073970.1074000openalex-snapshot
Selfish routing with incomplete information
inferredcites →https://doi.org/10.1145/7531.7535openalex-snapshot
Using dual approximation algorithms for scheduling problems theoretical and practical results
inferredcites →https://doi.org/10.1287/mnsc.6.1.1openalex-snapshot
Scheduling with Deadlines and Loss Functions
inferredcites →https://doi.org/10.4135/9781452275567.n5openalex-snapshot
An Introduction to Game Theory
inferredcites →https://doi.org/10.5860/choice.37-0975openalex-snapshot
Algorithms and theory of computation handbook

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-642-01347-8_60openalex-snapshot
A Reputation-Based Game for Tasks Allocation
inferred← citeshttps://doi.org/10.1007/978-3-642-02029-2_5openalex-snapshot
Asynchronous Congestion Games
inferred← citeshttps://doi.org/10.1007/s10845-014-0890-yopenalex-snapshot
A survey of multi-factory scheduling
inferred← citeshttps://doi.org/10.1016/j.apm.2017.02.033openalex-snapshot
Matheuristic for the decentralized factories scheduling problem
inferred← citeshttps://doi.org/10.1051/ro/2020044openalex-snapshot
Multi-objective multi-factory scheduling
inferred← citeshttps://doi.org/10.1080/0951192x.2015.1099074openalex-snapshot
Graph colouring-based algorithm to parallel jobs scheduling on parallel factories
inferred← citeshttps://doi.org/10.1080/17509653.2021.1872456openalex-snapshot
Multi-agent capacitated scheduling for profit-maximizing using a decomposition-based branch and cut algorithm
inferred← citeshttps://doi.org/10.1109/hpcc.2011.115openalex-snapshot
A Decentralized Model for Controlling Selfish Use for Desktop Grid Systems
inferred← citeshttps://doi.org/10.1109/ispdc.2007.16openalex-snapshot
Divisible Load Scheduling: An Approach Using Coalitional Games
inferred← citeshttps://doi.org/10.1287/moor.1090.0394openalex-snapshot
Random Order Congestion Games
inferred← citeshttps://doi.org/10.5555/1402821.1402936openalex-snapshot
Asynchronous congestion games
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.