7.2 节参考文献
[1] James P. Kahan, and Amnon Rapoport. Theories of coalition formation. Psychology Press, 2014.
[2] Martin J. Osborne, and Ariel Rubinstein. A course in game theory. MIT press, 1994.
[3] Bezalel Peleg, and Peter Sudhölter. Introduction to the theory of cooperative games. Vol. 34. Springer Science & Business Media, 2007.
[4] Donald Bruce Gillies. Some theorems on n-person games. Princeton University, 1953.
[5] David Schmeidler. "The nucleolus of a characteristic function game." SIAM Journal on applied mathematics 17.6 (1969): 1163- 1170.
[6] Morton Davis, and Michael Maschler. "The kernel of a cooperative game." Naval Research Logistics Quarterly 12.3 (1965): 223-259.
[7] Lloyd S. Shapley. "A value for n-person games." (1953): 307-317.
[8] John F. Banzhaf III. "Weighted voting doesn't work: A mathematical analysis." Rutgers L. Rev. 19 (1964): 317.
[9] Robert J. Aumann, and Michael Maschler. "The bargaining set for cooperative games." Advances in game theory 52.1 (1964): 443-476.
[10] John Von Neumann, and Oskar Morgenstern. "Theory of games and economic behavior, 2nd rev." (1947).
[11] Vincent Conitzer, and Tuomas Sandholm. "Complexity of determining nonemptiness of the core." Proceedings of the 4th ACM
Conference on Electronic Commerce. 2003.
[12] Lilian Shiao-Yen Wu. "A dynamic theory for the class of games with nonempty cores." SIAM Journal on Applied Mathematics 32.2 (1977): 328-338.
[13] Tone Arnold, and Ulrich Schwalbe. "Dynamic coalition formation and the core." Journal of economic behavior & organization 49.3 (2002): 363-380.
[14] Michael Maschler, Bezalel Peleg, and Lloyd S. Shapley. "Geometric properties of the kernel, nucleolus, and related solution concepts." Mathematics of operations research 4.4 (1979): 303-338.
[15] Yoram Bachrach, et al. "The cost of stability in coalitional games." Algorithmic Game Theory: Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings 2. Springer Berlin Heidelberg, 2009.
[16] Makoto Yokoo, et al. "Coalitional games in open anonymous environments." AAAI. Vol. 5. 2005.
[17] Xiaotie Deng, and Christos H. Papadimitriou. "On the complexity of cooperative solution concepts." Mathematics of operations research 19.2 (1994): 257-266.
[18] Gianluigi Greco, et al. "On the complexity of core, kernel, and bargaining set." Artificial Intelligence 175.12-13 (2011): 1877-1910.
[19] Ehud Kalai, and Eitan Zemel. "Generalized network problems yielding totally balanced games." Operations Research 30.5 (1982): 998-1008.
[20] Ehud Kalai, and Eitan Zemel. "Totally balanced games and games of flow." Mathematics of Operations Research 7.3 (1982): 476-478.
[21] Daniel Granot, and Frieda Granot. "On some network flow games."
Mathematics of Operations Research 17.4 (1992): 792-841.
[22] Xiaotie Deng, Qizhi Fang, and Xiaoxun Sun. "Finding nucleolus of flow game." Journal of combinatorial optimization 18.1 (2009): 64- 86.
[23] Yoram Bachrach, and Jeffrey S. Rosenschein. "Power in threshold network flow games." Autonomous Agents and Multi-Agent Systems 18 (2009): 106-132.
[24] Haris Aziz, Felix Brandt, and Paul Harrenstein. "Monotone cooperative games and their threshold versions." Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1-Volume 1. 2010.
[25] Ezra Resnick, et al. "The cost of stability in network flow games." Mathematical Foundations of Computer Science 2009: 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings 34. Springer Berlin Heidelberg, 2009.
[26] Lloyd S. Shapley, and Martin Shubik. "The assignment game I: The core." International Journal of game theory 1 (1971): 111-130.
[27] Tamás Solymosi, and Tirukkannamangai ES Raghavan. "An algorithm for finding the nucleolus of assignment games." International Journal of Game Theory 23 (1994): 119-143.
[28] Xiaotie Deng, Toshihide Ibaraki, and Hiroshi Nagamochi. "Algorithmic aspects of the core of combinatorial optimization games." Mathematics of Operations Research 24.3 (1999): 751-766.
[29] Walter Kern, and Daniël Paulusma. "Matching games: the least core and the nucleolus." Mathematics of operations research 28.2 (2003): 294-308.
[30] Charles G. Bird. "On cost allocation for a spanning tree: a game theoretic approach." Networks 6.4 (1976): 335-350.
[31] Daniel Granot, and Gur Huberman. "Minimum cost spanning tree games." Mathematical programming 21 (1981): 1-18.
[32] Ulrich Faigle, et al. "On the complexity of testing membership in the core of min-cost spanning tree games." International Journal of Game Theory 26 (1997): 361-366.
[33] Ulrich Faigle, Walter Kern, and Jeroen Kuipers. "Note: Computing the nucleolus of min-cost spanning tree games is NP-hard." International Journal of Game Theory 27.3 (1998).
[34] Onn Shehory, and Sarit Kraus. "Methods for task allocation via agent coalition formation." Artificial intelligence 101.1-2 (1998): 165-200.
[35] Sarit Kraus, Onn Shehory, and Gilad Taase. "Coalition formation with uncertain heterogeneous information." Proceedings of the second international joint conference on Autonomous agents and multiagent systems. 2003.
[36] Sarit Kraus, Onn Shehory, and Gilad Taase. "The advantages of compromising in coalition formation with incomplete information." AAMAS. Vol. 4. 2004.
[37] Efrat Manisterski, et al. "Forming efficient agent groups for completing complex tasks." Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems. 2006.
[38] Samir Aknine, Suzanne Pinson, and Melvin F. Shakun. "A multi- agent coalition formation method based on preference models." Group Decision and Negotiation 13 (2004): 513-538.
[39] Matthias Klusch, and Onn Shehory. "Coalition formation among rational information agents." European workshop on modelling autonomous agents in a multi-agent world. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996.
[40] Matthias Klusch, and Onn Shehory. "A polynomial kernel-oriented coalition algorithm for rational information agents." Tokoro, ed (1996): 157-164.
[41] Samir Aknine, and Philippe Caillou. "Agreements without disagreements." ECAI. Vol. 16. 2004.
[42] Enric Plaza, and Santiago Ontañón. "Learning collaboration strategies for committees of learning agents." Autonomous Agents and Multi-Agent Systems 13 (2006): 429-461.
[43] Georgios Chalkiadakis, Edith Elkind, and Michael Wooldridge. Computational aspects of cooperative game theory. Springer Nature, 2022.
[44] Stéphane Airiau. "Cooperative games and multiagent systems." The Knowledge Engineering Review 28.4 (2013): 381-424.