메뉴 건너뛰기




Volumn 172, Issue 14, 2008, Pages 1673-1699

A linear approximation method for the Shapley value

Author keywords

Approximation method; Coalitional game theory; Shapley value

Indexed keywords

ADDITION REACTIONS; APPROXIMATION THEORY; BOOLEAN FUNCTIONS; EIGENVALUES AND EIGENFUNCTIONS; GAME THEORY; POLYNOMIAL APPROXIMATION; WEIGHING;

EID: 47649117256     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2008.05.003     Document Type: Article
Times cited : (201)

References (39)
  • 2
    • 0000234444 scopus 로고
    • Acceptable Points in General Cooperative n-Person Games
    • Princeton University Press
    • Aumann R. Acceptable Points in General Cooperative n-Person Games. Contributions to the Theory of Games vol. IV (1959), Princeton University Press
    • (1959) Contributions to the Theory of Games , vol.IV
    • Aumann, R.1
  • 4
    • 84899967235 scopus 로고    scopus 로고
    • Y. Bachrach, J. Rosenschein, Approximating power indices, in: Proceedings of the Seventh International Conference on Autonomous Agents and Multi-Agent Systems, 2008
    • Y. Bachrach, J. Rosenschein, Approximating power indices, in: Proceedings of the Seventh International Conference on Autonomous Agents and Multi-Agent Systems, 2008
  • 6
    • 0038249934 scopus 로고    scopus 로고
    • Generating functions for computing power indices efficiently
    • Bilbao J.M., Fernandez J.R., Losada A.J., and Lopez J.J. Generating functions for computing power indices efficiently. Top 8 2 (2000) 191-213
    • (2000) Top , vol.8 , Issue.2 , pp. 191-213
    • Bilbao, J.M.1    Fernandez, J.R.2    Losada, A.J.3    Lopez, J.J.4
  • 9
    • 9644266731 scopus 로고    scopus 로고
    • V. Conitzer, T. Sandholm, Computing Shapley values, manipulating value division schemes, and checking core membership in multi-issue domains, in: Proceedings of the National Conference on Artificial Intelligence, San Jose, California, 2004, pp. 219-225
    • V. Conitzer, T. Sandholm, Computing Shapley values, manipulating value division schemes, and checking core membership in multi-issue domains, in: Proceedings of the National Conference on Artificial Intelligence, San Jose, California, 2004, pp. 219-225
  • 10
    • 33645331578 scopus 로고    scopus 로고
    • Complexity of constructing solutions in the core based on synergies among coalitions
    • Conitzer V., and Sandholm T. Complexity of constructing solutions in the core based on synergies among coalitions. Artificial Intelligence Journal 170 (2006) 607-619
    • (2006) Artificial Intelligence Journal , vol.170 , pp. 607-619
    • Conitzer, V.1    Sandholm, T.2
  • 13
    • 36348995401 scopus 로고    scopus 로고
    • E. Elkind, L.A. Goldberg, P. Goldberg, M. Wooldridge, Computational complexity of weighted threshold games, in: Proceedings of the National Conference on Artificial Intelligence (AAAI-2007), 2007
    • E. Elkind, L.A. Goldberg, P. Goldberg, M. Wooldridge, Computational complexity of weighted threshold games, in: Proceedings of the National Conference on Artificial Intelligence (AAAI-2007), 2007
  • 14
    • 60349083177 scopus 로고    scopus 로고
    • S.S. Fatima, M. Wooldridge, N.R. Jennings, A randomized method for the Shapley value for the voting game, in: Proceedings of the Sixth International Conference on Autonomous Agents and Multi-Agent Systems, 2007, pp. 955-962
    • S.S. Fatima, M. Wooldridge, N.R. Jennings, A randomized method for the Shapley value for the voting game, in: Proceedings of the Sixth International Conference on Autonomous Agents and Multi-Agent Systems, 2007, pp. 955-962
  • 16
    • 30044441223 scopus 로고    scopus 로고
    • S. Ieong, Y. Shoham, Marginal contribution nets: A compact representation scheme for coalitional games, in: Proceedings of the Sixth ACM Conference on Electronic Commerce, Vancouver, Canada, 2005, pp. 193-202
    • S. Ieong, Y. Shoham, Marginal contribution nets: A compact representation scheme for coalitional games, in: Proceedings of the Sixth ACM Conference on Electronic Commerce, Vancouver, Canada, 2005, pp. 193-202
  • 17
    • 33748696967 scopus 로고    scopus 로고
    • S. Ieong, Y. Shoham, Multi-attribute coalition games, in: Proceedings of the Seventh ACM Conference on Electronic Commerce, Ann Arbor, Michigan, 2006, pp. 170-179
    • S. Ieong, Y. Shoham, Multi-attribute coalition games, in: Proceedings of the Seventh ACM Conference on Electronic Commerce, Ann Arbor, Michigan, 2006, pp. 170-179
  • 19
    • 0038106592 scopus 로고    scopus 로고
    • Computing power indices for large voting games
    • Leech D. Computing power indices for large voting games. Management Science 49 6 (2003) 831-837
    • (2003) Management Science , vol.49 , Issue.6 , pp. 831-837
    • Leech, D.1
  • 20
    • 47649109462 scopus 로고    scopus 로고
    • I. Mann, L.S. Shapley, Values for large games IV: Evaluating the electoral college by Monte Carlo techniques, Technical report, The RAND Corporation, Santa Monica, 1960
    • I. Mann, L.S. Shapley, Values for large games IV: Evaluating the electoral college by Monte Carlo techniques, Technical report, The RAND Corporation, Santa Monica, 1960
  • 21
    • 47649109723 scopus 로고    scopus 로고
    • I. Mann, L.S. Shapley, Values for large games IV: Evaluating the electoral college exactly, Technical report, The RAND Corporation, Santa Monica, 1962
    • I. Mann, L.S. Shapley, Values for large games IV: Evaluating the electoral college exactly, Technical report, The RAND Corporation, Santa Monica, 1962
  • 24
    • 0003144759 scopus 로고
    • Multilinear extensions of games
    • Owen G. Multilinear extensions of games. Management Science 18 5 (1972) 64-79
    • (1972) Management Science , vol.18 , Issue.5 , pp. 64-79
    • Owen, G.1
  • 26
    • 34249661503 scopus 로고    scopus 로고
    • An algorithm for distributing coalitional value calculations among cooperating agents
    • Rahwan T., and Jennings N.R. An algorithm for distributing coalitional value calculations among cooperating agents. Artificial Intelligence Journal 171 (2007) 535-567
    • (2007) Artificial Intelligence Journal , vol.171 , pp. 535-567
    • Rahwan, T.1    Jennings, N.R.2
  • 29
    • 0001864867 scopus 로고
    • Introduction to the Shapely value
    • Roth A.E. (Ed), University of Cambridge Press, Cambridge
    • Roth A.E. Introduction to the Shapely value. In: Roth A.E. (Ed). The Shapley Value (1988), University of Cambridge Press, Cambridge 1-27
    • (1988) The Shapley Value , pp. 1-27
    • Roth, A.E.1
  • 31
    • 0031191005 scopus 로고    scopus 로고
    • Coalitions among computationally bounded agents
    • Sandholm T., and Lesser V. Coalitions among computationally bounded agents. Artificial Intelligence Journal 94 1 (1997) 99-137
    • (1997) Artificial Intelligence Journal , vol.94 , Issue.1 , pp. 99-137
    • Sandholm, T.1    Lesser, V.2
  • 32
    • 22844447516 scopus 로고
    • A value for n person games
    • Roth A.E. (Ed), University of Cambridge Press, Cambridge
    • Shapley L.S. A value for n person games. In: Roth A.E. (Ed). The Shapley Value (1988), University of Cambridge Press, Cambridge 31-40
    • (1988) The Shapley Value , pp. 31-40
    • Shapley, L.S.1
  • 33
    • 0030359052 scopus 로고    scopus 로고
    • O. Shehory, S. Kraus, A kernel-oriented model for coalition-formation in general environments: Implementation and results, in: Proceedings of the National Conference on Artificial Intelligence (AAAI-96), 1996, pp. 131-140
    • O. Shehory, S. Kraus, A kernel-oriented model for coalition-formation in general environments: Implementation and results, in: Proceedings of the National Conference on Artificial Intelligence (AAAI-96), 1996, pp. 131-140
  • 34
    • 0032074719 scopus 로고    scopus 로고
    • Methods for task allocation via agent coalition formation
    • Shehory O., and Kraus S. Methods for task allocation via agent coalition formation. Artificial Intelligence Journal 101 2 (1998) 165-200
    • (1998) Artificial Intelligence Journal , vol.101 , Issue.2 , pp. 165-200
    • Shehory, O.1    Kraus, S.2
  • 35
    • 0038786720 scopus 로고    scopus 로고
    • Power in weighted voting games
    • Tanenbaum P. Power in weighted voting games. The Mathematica Journal 7 (1997) 58-63
    • (1997) The Mathematica Journal , vol.7 , pp. 58-63
    • Tanenbaum, P.1
  • 37
    • 47649101019 scopus 로고
    • Finding bounds for definite integrals
    • Underhill W.V. Finding bounds for definite integrals. The College Mathematics Journal 15 5 (1984) 426-429
    • (1984) The College Mathematics Journal , vol.15 , Issue.5 , pp. 426-429
    • Underhill, W.V.1
  • 39
    • 0028555267 scopus 로고    scopus 로고
    • G. Zlotkin, J. Rosenschein, Coalition, cryptography, and stability: mechanisms foe coalition formation in task oriented domains, in: Proceedings of the National Conference on Artificial Intelligence (AAAI-94), 1994, pp. 432-437
    • G. Zlotkin, J. Rosenschein, Coalition, cryptography, and stability: mechanisms foe coalition formation in task oriented domains, in: Proceedings of the National Conference on Artificial Intelligence (AAAI-94), 1994, pp. 432-437


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