Task allocation via multi-agent coalition formation: taxonomy, algorithms and complexity
暂无分享,去创建一个
[1] Rainer Schrader,et al. ON THE EXISTENCE OF FAST APPROXIMATION SCHEMES , 1981 .
[2] Onn Shehory,et al. Coalition structure generation with worst case guarantees , 2022 .
[3] Eugene L. Lawler,et al. Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.
[4] Chak-Kuen Wong,et al. Approximate Algorithms for Some Generalized Knapsack Problems , 1976, Theor. Comput. Sci..
[5] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[6] A. Frieze,et al. Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses , 1984 .
[7] Katia P. Sycara,et al. A stable and efficient buyer coalition formation scheme for e-marketplaces , 2001, AGENTS '01.
[8] Sarit Kraus,et al. Feasible Formation of Coalitions Among Autonomous Agents in Nonsuperadditive Environments , 1999, Comput. Intell..
[9] Sarit Kraus,et al. Methods for Task Allocation via Agent Coalition Formation , 1998, Artif. Intell..