메뉴 건너뛰기




Volumn , Issue , 2013, Pages 324-331

Coalitional games via network flows

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTERISTIC FUNCTIONS; COALITION STRUCTURE; COALITIONAL GAME; CONVENTIONAL APPROACH; FLOWTHROUGH; NEAR-OPTIMAL SOLUTIONS; NETWORK FLOWS; REPRESENTATION SCHEMES;

EID: 84896062456     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (7)

References (29)
  • 1
    • 80055079337 scopus 로고    scopus 로고
    • Representation of coalitional games with algebraic decision diagrams
    • K. V. Aadithya, T. P. Michalak, and N. R. Jennings. Representation of coalitional games with algebraic decision diagrams. In Proceedings of AAMAS, pages 1121-1122, 2011.
    • (2011) Proceedings of AAMAS , pp. 1121-1122
    • Aadithya, K.V.1    Michalak, T.P.2    Jennings, N.R.3
  • 2
    • 80055073124 scopus 로고    scopus 로고
    • Complexity of coalition structure generation
    • Haris Aziz and Bart de Keijzer. Complexity of coalition structure generation. In Proceedings of AAMAS, pages 191-198, 2011.
    • (2011) Proceedings of AAMAS , pp. 191-198
    • Aziz, H.1    De Keijzer, B.2
  • 4
    • 58049177903 scopus 로고    scopus 로고
    • Power in threshold network flow games
    • Y. Bachrach and J.S. Rosenschein. Power in threshold network flow games. AAMAS, 18(1):106-132, 2009.
    • (2009) AAMAS , vol.18 , Issue.1 , pp. 106-132
    • Bachrach, Y.1    Rosenschein, J.S.2
  • 6
    • 9644266731 scopus 로고    scopus 로고
    • Complexity of determining nonemptiness in the core
    • V. Conitzer and T. Sandholm. Complexity of Determining Nonemptiness in The Core. In Proceedings of IJCAI, pages 219-225, 2004.
    • (2004) Proceedings of IJCAI , pp. 219-225
    • Conitzer, V.1    Sandholm, T.2
  • 7
    • 49349086951 scopus 로고    scopus 로고
    • Computing shapley values, manipulating value division schemes and checking core membership in multiissue domains
    • V. Conitzer and T. Sandholm. Computing shapley values, manipulating value division schemes and checking core membership in multiissue domains. In AAAI, pages 42-47, 2004.
    • (2004) AAAI , pp. 42-47
    • Conitzer, V.1    Sandholm, T.2
  • 9
    • 84885969917 scopus 로고    scopus 로고
    • Coalition structure generation in task-based settings
    • Viet Dung Dang and Nicholas R. Jennings. Coalition structure generation in task-based settings. In ECAI, pages 210-214, 2006.
    • (2006) ECAI , pp. 210-214
    • Dang, V.D.1    Jennings, N.R.2
  • 10
    • 33750735386 scopus 로고    scopus 로고
    • Overlapping coalition formation for efficient data fusion in multi-sensor networks
    • V. D. Dang, R. K. Dash, A. Rogers, and N. R. Jennings. Overlapping coalition formation for efficient data fusion in multi-sensor networks. In Proceedings of AAAI, pages 635-640, 2006.
    • (2006) Proceedings of AAAI , pp. 635-640
    • Dang, V.D.1    Dash, R.K.2    Rogers, A.3    Jennings, N.R.4
  • 11
    • 0000138929 scopus 로고
    • On the complexity of cooperative solution concepts
    • X. Deng and C. Papadimitriou. On the complexity of cooperative solution concepts. Mathematical OR, (19):257-266, 1994.
    • (1994) Mathematical OR , vol.19 , pp. 257-266
    • Deng, X.1    Papadimitriou, C.2
  • 12
    • 70349141421 scopus 로고    scopus 로고
    • A tractable and expressive class of marginal contribution nets and its applications
    • E. Elkind, L. A. Goldberg, P. W. Goldberg, and M.Wooldridge. A tractable and expressive class of marginal contribution nets and its applications. Mathematical Logic Quarterly, 55(4):362-376, 2009.
    • (2009) Mathematical Logic Quarterly , vol.55 , Issue.4 , pp. 362-376
    • Elkind, E.1    Goldberg, L.A.2    Goldberg, P.W.3    Wooldridge, M.4
  • 14
    • 0030304778 scopus 로고    scopus 로고
    • On the complexity of the production-transportation problem
    • D.S. Hochbaum and S.P. Hong. On the complexity of the production-transportation problem. SIAM J. on Optimization, 6(1):250-264, 1996.
    • (1996) SIAM J. on Optimization , vol.6 , Issue.1 , pp. 250-264
    • Hochbaum, D.S.1    Hong, S.P.2
  • 15
    • 0346129939 scopus 로고    scopus 로고
    • A production-transportation problem with stochastic demand and concave production costs
    • K. Holmberg and H. Tuy. A production-transportation problem with stochastic demand and concave production costs. Mathematical programming, 85(1):157-179, 1999.
    • (1999) Mathematical Programming , vol.85 , Issue.1 , pp. 157-179
    • Holmberg, K.1    Tuy, H.2
  • 16
    • 33748696967 scopus 로고    scopus 로고
    • Marginal contribution nets: A complact representation scheme for coalitional games
    • S. Ieong and Y. Shoham. Marginal contribution nets: A complact representation scheme for coalitional games. In Proceedings of ACM EC, pages 170-179, 2006.
    • (2006) Proceedings of ACM EC , pp. 170-179
    • Ieong, S.1    Shoham, Y.2
  • 17
    • 0001642246 scopus 로고
    • On totally balanced games and games of flow
    • E. Kalai and E. ZemelL. On Totally Balanced Games and Games of Flow. In Mathematics of Operations Research, 7(3):476-478, 1982.
    • (1982) Mathematics of Operations Research , vol.7 , Issue.3 , pp. 476-478
    • Kalai, E.1    Zemell, E.2
  • 19
    • 77958596926 scopus 로고    scopus 로고
    • Coalition structure generation utilizing compact characteristic function representations
    • to appear
    • N. Ohta, V. Conitzer, R. Ichimura, Y. Sakurai, A. Iwasaki, and M. Yokoo. Coalition structure generation utilizing compact characteristic function representations. In Proceedings of CP (to appear), 2009.
    • (2009) Proceedings of CP
    • Ohta, N.1    Conitzer, V.2    Ichimura, R.3    Sakurai, Y.4    Iwasaki, A.5    Yokoo, M.6
  • 21
    • 84868268213 scopus 로고    scopus 로고
    • Minimum search to establish worst-case guarantees in coalition structure generation
    • Talal Rahwan, Tomasz P. Michalak, and Nicholas R. Jennings. Minimum search to establish worst-case guarantees in coalition structure generation. In Proceedings of IJCAI, pages 338-343, 2011.
    • (2011) Proceedings of IJCAI , pp. 338-343
    • Rahwan, T.1    Michalak, T.P.2    Jennings, N.R.3
  • 22
    • 84860516799 scopus 로고    scopus 로고
    • Anytime coalition structure generation in multi-agent systems with positive or negative externalities
    • Talal Rahwan, Tomasz P. Michalak, Michael Wooldridge, and Nicholas R. Jennings. Anytime coalition structure generation in multi-agent systems with positive or negative externalities. Artificial Intelligence (AIJ), 186:95-122, 2012.
    • (2012) Artificial Intelligence (AIJ) , vol.186 , pp. 95-122
    • Rahwan, T.1    Michalak, T.P.2    Wooldridge, M.3    Jennings, N.R.4
  • 23
    • 0033165014 scopus 로고    scopus 로고
    • Coalition structure generation with worst case guarantees
    • July
    • Tuomas Sandholm, Kate Larson, Martin Andersson, Onn Shehory, and Fernando Tohmé. Coalition structure generation with worst case guarantees. Artif. Intell., 111(1-2):209-238, July 1999.
    • (1999) Artif. Intell. , vol.111 , Issue.1-2 , pp. 209-238
    • Sandholm, T.1    Larson, K.2    Andersson, M.3    Shehory, O.4    Tohmé, F.5
  • 25
    • 0040235864 scopus 로고    scopus 로고
    • Formation of overlapping coalitions for precedence-ordered task-execution among autonomous agents
    • O. Shehory and S. Kraus. Formation of overlapping coalitions for precedence-ordered task-execution among autonomous agents. In Proceedings of ICMAS, pages 330-337, 1996.
    • (1996) Proceedings of ICMAS , pp. 330-337
    • Shehory, O.1    Kraus, S.2
  • 26
    • 0032074719 scopus 로고    scopus 로고
    • Methods for task allocation via agent coalition formation
    • O. Shehory and S. Kraus. Methods for task allocation via agent coalition formation. Artificial Intelligence (AIJ), 1(101):165-200, 1998.
    • (1998) Artificial Intelligence (AIJ) , vol.1 , Issue.101 , pp. 165-200
    • Shehory, O.1    Kraus, S.2
  • 27
    • 0006763479 scopus 로고    scopus 로고
    • A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
    • H. Tuy, S. Ghannadan, A. Migdalas, and P. Värbrand. A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables. Mathematical Programming, 72(3):229-258, 1996.
    • (1996) Mathematical Programming , vol.72 , Issue.3 , pp. 229-258
    • Tuy, H.1    Ghannadan, S.2    Migdalas, A.3    Värbrand, P.4
  • 28
    • 84860705275 scopus 로고    scopus 로고
    • Concise characteristic function representations in coalitional games based on agent types
    • Suguru Ueda, Makoto Kitaki, Atsushi Iwasaki, and Makoto Yokoo. Concise characteristic function representations in coalitional games based on agent types. In Proceedings of IJCAI, pages 393-399, 2011.
    • (2011) Proceedings of IJCAI , pp. 393-399
    • Ueda, S.1    Kitaki, M.2    Iwasaki, A.3    Yokoo, M.4
  • 29
    • 33646783315 scopus 로고    scopus 로고
    • On the computational complexity of coalitional resource games
    • M. Wooldridge and P. Dunne. On the computational complexity of coalitional resource games. Artificial Intelligence (AIJ), (170):835-871, 2006.
    • (2006) Artificial Intelligence (AIJ) , vol.170 , pp. 835-871
    • Wooldridge, M.1    Dunne, P.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.