On the public citation graph
A negotiation‐based method for task allocation with time constraints in open grid environments
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.
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.1006/game.2000.0831openalex-snapshot
Leveled Commitment Contracts and Strategic Breach
inferredcites →https://doi.org/10.1016/j.artint.2007.11.007openalex-snapshot
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
inferredcites →https://doi.org/10.1016/s0167-9236(99)00067-6openalex-snapshot
The POPCORN market. Online markets for computational resources
inferredcites →https://doi.org/10.1023/a:1008746126376openalex-snapshot
Automated Negotiation: Prospects, Methods and Challenges
inferredcites →https://doi.org/10.1109/euc.2011.22openalex-snapshot
Combinatorial Auction-Based Task Allocation in Multi-application Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/icmas.1998.699077openalex-snapshot
A market protocol for decentralized task allocation
inferredcites →https://doi.org/10.1109/jproc.2006.876939openalex-snapshot
Market-Based Multirobot Coordination: A Survey and Analysis
inferredcites →https://doi.org/10.1109/tro.2009.2022423openalex-snapshot
Consensus-Based Decentralized Auctions for Robust Task Allocation
inferredcites →https://doi.org/10.1109/tsmca.2007.893474openalex-snapshot
Market-Based Task Allocation Mechanisms for Limited-Capacity Suppliers
inferredcites →https://doi.org/10.1109/wi-iat.2009.185openalex-snapshot
Bilateral Bargaining with One-Sided Two-Type Uncertainty
inferredcites →https://doi.org/10.1145/1329125.1329190openalex-snapshot
Overlay networks for task allocation and coordination in dynamic large-scale networks of cooperative agents
inferredcites →https://doi.org/10.1145/1329125.1329217openalex-snapshot
Distributed task allocation in social networks
inferredcites →https://doi.org/10.1145/352871.352900openalex-snapshot
Combinatorial auctions for supply chain formation
inferredcites →https://doi.org/10.1145/375735.376439openalex-snapshot
Adaptive task resources allocation in multi-agent systems
inferredcites →https://doi.org/10.1609/aaai.v25i1.7866openalex-snapshot
A Distributed Anytime Algorithm for Dynamic Task Allocation in Multi-Agent Systems
inferredcites →https://doi.org/10.2307/1912531openalex-snapshot
Perfect Equilibrium in a Bargaining Model
inferredcites →https://doi.org/10.3233/978-1-61499-096-3-125openalex-snapshot
Adaptive Negotiation for Resource Intensive Tasks in Grids
inferredcites →https://doi.org/10.3233/mgs-2005-1303openalex-snapshot
Tycoon: An implementation of a distributed, market-based resource allocation system
inferredcites →https://doi.org/10.5555/1402298.1402303openalex-snapshot
Reaction functions for task allocation to cooperative agents
inferredcites →https://doi.org/10.5555/1838206.1838338openalex-snapshot
Automated negotiation with decommitment for dynamic resource allocation in cloud computing
inferredcites →https://doi.org/10.5555/2031678.2031704openalex-snapshot
Agent-mediated multi-step optimization for resource allocation in distributed sensor networks
inferredcites →https://doi.org/10.65109/lqgi4952openalex-snapshot
On coalition formation with sparse synergies
inferredcites →https://doi.org/10.65109/vcvd1580openalex-snapshot
Adaptive learning in evolving task allocation networks
inferredcites →https://doi.org/10.7551/mitpress/8637.003.0011openalex-snapshot
Combinatorial Auctions
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.4167openalex-snapshot
Near‐optimal dynamic priority scheduling strategy for instance‐intensive business workflows in cloud computing
inferred← citeshttps://doi.org/10.1016/j.ast.2026.112445openalex-snapshot
A hybrid utility-driven scheduling framework with heuristic pruning dynamic sliding time-window algorithm for task allocation under complex constraints
inferred← citeshttps://doi.org/10.1108/k-10-2018-0565openalex-snapshot
Modelling decision making in digital supply chains: insights from the petroleum industry
inferred← citeshttps://doi.org/10.1109/cseps53726.2021.00055openalex-snapshot
Sensor Management Method based on Optimal Response Dynamics with Game Theory
inferred← citeshttps://doi.org/10.1109/iciibms62405.2024.10792681openalex-snapshot
Task Allocation for Heterogeneous Robots in Office Environments Using Large Language Models
inferred← citeshttps://doi.org/10.1109/iros58592.2024.10802322openalex-snapshot
SMART-LLM: Smart Multi-Agent Robot Task Planning using Large Language Models
inferred← citeshttps://doi.org/10.1109/tevc.2021.3049131openalex-snapshot
Task Allocation on Layered Multiagent Systems: When Evolutionary Many-Objective Optimization Meets Deep Q-Learning
inferred← citeshttps://doi.org/10.1109/wi-iat.2015.57openalex-snapshot
Balanced Team Formation for Tasks with Deadlines
inferred← citeshttps://doi.org/10.15607/rss.2022.xviii.032openalex-snapshot
Embodied Multi-Agent Task Planning from Ambiguous Instruction
inferred← citeshttps://doi.org/10.2139/ssrn.5962858openalex-snapshot
A Hybrid Utility-driven Scheduling Framework with Heuristic Purning Dynamic Sliding Time Window Algorithm for Task Allocation under Complex Constraints
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.