On the public citation graph
How to Form a Task-Oriented Robust Team
0 signed · 41 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/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-642-32723-0_27openalex-snapshot
Robust Multi-robot Team Formations Using Weighted Voting Games
inferredcites →https://doi.org/10.1007/bf01935053openalex-snapshot
A dynamic programming approach to the complete set partitioning problem
inferredcites →https://doi.org/10.1007/s10732-006-6726-yopenalex-snapshot
Bucket elimination for multiobjective optimization problems
inferredcites →https://doi.org/10.1016/0004-3702(95)00044-5openalex-snapshot
Phase transitions and the search problem
inferredcites →https://doi.org/10.1016/j.artint.2013.12.002openalex-snapshot
Weighted synergy graphs for effective team formation with heterogeneous ad hoc agents
inferredcites →https://doi.org/10.1016/s0004-3702(99)00036-3openalex-snapshot
Coalition structure generation with worst case guarantees
inferredcites →https://doi.org/10.1023/b:anor.0000019104.39239.edopenalex-snapshot
Solving the Problem of Rerostering Nurse Schedules with Hard Constraints: New Multicommodity Flow Models
inferredcites →https://doi.org/10.1080/09528130410001710792openalex-snapshot
The effects of co-operation on multiagent search in task-oriented domains
inferredcites →https://doi.org/10.1109/ictai.2010.69openalex-snapshot
Best-First vs. Depth-First AND/OR Search for Multi-objective Constraint Optimization
inferredcites →https://doi.org/10.1109/iros.2013.6697114openalex-snapshot
Forming an effective multi-robot team robust to failures
inferredcites →https://doi.org/10.1109/robot.2005.1570329openalex-snapshot
Complex Task Allocation For Multiple Robots
inferredcites →https://doi.org/10.1109/tpds.2004.24openalex-snapshot
Measuring the robustness of a resource allocation
inferredcites →https://doi.org/10.1109/tro.2009.2022423openalex-snapshot
Consensus-Based Decentralized Auctions for Robust Task Allocation
inferredcites →https://doi.org/10.1145/1082473.1082508openalex-snapshot
Agent-organized networks for dynamic team formation
inferredcites →https://doi.org/10.1145/1557019.1557074openalex-snapshot
Finding a team of experts in social networks
inferredcites →https://doi.org/10.1609/aaai.v26i1.8259openalex-snapshot
Competing with Humans at Fantasy Football: Team Formation in Large Partially-Observable Domains
inferredcites →https://doi.org/10.1609/aaai.v27i1.8653openalex-snapshot
Optimal Coalition Structure Generation in Cooperative Graph Games
inferredcites →https://doi.org/10.5555/1838206.1838452openalex-snapshot
Multiple UAV coalition formation strategies
inferredcites →https://doi.org/10.5555/2343576.2343625openalex-snapshot
Leading ad hoc agents in joint action settings with multiple teammates
inferredcites →https://doi.org/10.5555/2343576.2343628openalex-snapshot
Modeling and learning synergy for team formation with heterogeneous agents
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-030-03098-8_6openalex-snapshot
Heterogeneous Teams for Homogeneous Performance
inferred← citeshttps://doi.org/10.1007/978-3-030-03098-8_8openalex-snapshot
Bounded Approximate Algorithm for Probabilistic Coalition Structure Generation
inferred← citeshttps://doi.org/10.1007/978-3-030-03098-8_9openalex-snapshot
Robust Coalition Structure Generation
inferred← citeshttps://doi.org/10.1007/978-3-319-46882-2_2openalex-snapshot
Evaluating the Efficiency of Robust Team Formation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-59294-7_3openalex-snapshot
A Concise Review on Multiagent Teams: Contributions and Research Opportunities
inferred← citeshttps://doi.org/10.1007/978-3-319-59930-4_8openalex-snapshot
Integrating Decentralized Coordination and Reactivity in MAS for Repair-Task Allocations
inferred← citeshttps://doi.org/10.1007/978-3-319-64798-2_4openalex-snapshot
Team Formation Through Preference-Based Behavior Composition
inferred← citeshttps://doi.org/10.1007/978-3-319-78301-7_11openalex-snapshot
Evaluating Task-Allocation Strategies for Emergency Repair in MAS
inferred← citeshttps://doi.org/10.1007/s10458-020-09449-8openalex-snapshot
Two approximation algorithms for probabilistic coalition structure generation with quality bound
inferred← citeshttps://doi.org/10.1016/j.knosys.2019.06.007openalex-snapshot
Synergistic team composition: A computational approach to foster diversity in teams
inferred← citeshttps://doi.org/10.1109/icdmw58026.2022.00130openalex-snapshot
ULTRA: A Data-driven Approach for Recommending Team Formation in Response to Proposal Calls
inferred← citeshttps://doi.org/10.1109/isamsr.2016.7810004openalex-snapshot
The rationality of sincere software agent in task completion
inferred← citeshttps://doi.org/10.12792/iciae2017.041openalex-snapshot
A Robust Mechanism for Robot Team Formation
inferred← citeshttps://doi.org/10.1609/aaai.v38i21.30318openalex-snapshot
Promoting Research Collaboration with Open Data Driven Team Recommendation in Response to Call for Proposals
inferred← citeshttps://doi.org/10.3233/faia200074openalex-snapshot
An Ideal Team Is More than a Team of Ideal Agents
inferred← citeshttps://doi.org/10.65109/bcap5841openalex-snapshot
Recoverable Team Formation: Building Teams Resilient to Change
inferred← citeshttps://doi.org/10.65109/hebh6798openalex-snapshot
Robust Peer-Monitoring on Graphs with an Application to Suicide Prevention in Social Networks
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.