A compact representation scheme of coalitional games based on multi-terminal zero-suppressed binary decision diagrams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7047 LNAI, Issue , 2011, Pages 4-18

  Sakurai, Yuko ^a   Ueda, Suguru ^a   Iwasaki, Atsushi ^a   Minato, Shin Ichi ^b   Yokoo, Makoto ^a  

^a KYUSHU UNIVERSITY   (Japan)

^b HOKKAIDO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BLACK-BOX FUNCTIONS; CHARACTERISTIC FUNCTIONS; COALITION STRUCTURE; COALITIONAL GAME; COMPACT REPRESENTATION; CONCISE REPRESENTATIONS; DATA MINING AND KNOWLEDGE DISCOVERY; DISCRETE STRUCTURE; MULTI TERMINALS; POLYNOMIAL-TIME; REPRESENTATION SCHEMES; RESEARCH COMMUNITIES; ZERO-SUPPRESSED BINARY DECISION DIAGRAMS;

DATA PRIVACY; DECISION THEORY; ELECTRIC FAULT CURRENTS; EMBEDDED SYSTEMS; MULTI AGENT SYSTEMS; NETWORK SECURITY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

BINARY DECISION DIAGRAMS;

EID: 81855198103     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25044-6_4     Document Type: Conference Paper

References (21)

1. Aadithya, K., Michalak, T., Jennings, N.: Representation of Coalitional Games with Algebraic Decision Diagrams. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), pp. 1121-1122 (2011)
2. Airiau, S., Sen, S.: On the stability of an optimal coalition structure. In: Proceeding of the 19th European Conference on Artificial Intelligence (ECAI 2010), pp. 203-208 (2010)
3. Akers, S.B.: Binary decision diagrams. IEEE Transactions on Computers C-27(6), 509-516 (1978)
4. Aumann, R.J., Dreze, J.H.: Cooperative games with coalition structures. International Journal of Game Theory 3, 217-237 (1974)
5. Bachrach, Y., Elkind, E., Meir, R., Pasechnik, D., Zuckerman,M., Rothe, J., Rosenschein, J.S.: The Cost of Stability in Coalitional Games. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 122-134. Springer, Heidelberg (2009)
6. Berghammer, R., Bolus, S.: Problem Solving on Simple Games via BDDs. In: Proceedings of the 3rd International Workshop on Computation Social Choice, COMSOC 2010 (2010)
7. Bryant, R.E.: Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams. ACM Computing Surveys 24(3), 293-318 (1992)
8. Conitzer, V., Sandholm, T.: Complexity of constructing solutions in the core based on synergies among coalitions. Artificial Intelligence 170(6), 607-619 (2006)
9. Elkind, E., Goldberg, L.A., Goldberg, P.W., Wooldridge, M.: A tractable and expressive class of marginal contribution nets and its applications. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), pp. 1007-1014 (2008)
10. Engel, Y., Wellman, M.P.: Generalized value decomposition and structured multiattribute auctions. In: Proceedings of the 8th ACM Conference on Electronic Commerce (EC 2007), pp. 227-236 (2007)
11. Faigle, U., Fekete, S.P., Hochstättler, W., Kern, W.: On the complexity of testing membership in the core of min-cost spanning tree games. International Journal of Game Theory 26, 361-366 (1997)
12. 1-ε. Acta Mathematica 182, 105-142 (1999)
13. Ieong, S., Shoham, Y.: Marginal contribution nets: a compact representation scheme for coalitional games. In: Proceedings of the 5th ACM Conference on Electronic Commerce (EC 2005), pp. 193-202 (2005)
14. Knuth, D.: The art of computer programming 4, Fascicle 1 (2009)
15. Loekito, E., Bailey, J.: Fast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagrams. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2006), pp. 307-316 (2006)
16. Minato, S.: Zero-suppressed bdds for set manipulation in combinatorial problems. In: Proceedings of the 30th Design Automation Conference (DAC 1993), pp. 272-277 (1993)
17. Minato, S.: Arithmetic boolean expression manipulator using bdds. Formal Methods in System Design 10(2/3), 221-242 (1997)
18. Ohta, N., Conitzer, V., Ichimura, R., Sakurai, Y., Iwasaki, A., Yokoo, M.: Coalition Structure Generation Utilizing Compact Characteristic Function Representations. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 623-638. Springer, Heidelberg (2009)
19. Sandholm, T., Larson, K., Andersson, M., Shehory, O., Tohmé, F.: Coalition structure generation with worst case guarantees. Artificial Intelligence 111(1-2), 209-238 (1999)
20. Shrot, T., Aumann, Y., Kraus, S.: On agent types in coalition formation problems. In: Proceedings of the 9th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), pp. 757-764 (2010)
21. Uckelman, J., Chevaleyre, Y., Endriss, U., Lang, J.: Representing utility functions via weighted goals. Mathematical Logic Quarterly 55(4), 341-361 (2009)