메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 177-184

Temporal qualitative coalitional games

Author keywords

Coalitional games; Logic; Repeated games

Indexed keywords

AUTONOMOUS AGENTS; FORMAL LANGUAGES; GAME THEORY; PROBLEM SOLVING; SET THEORY;

EID: 34247257363     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1160633.1160662     Document Type: Conference Paper
Times cited : (17)

References (15)
  • 1
    • 84945914804 scopus 로고    scopus 로고
    • Alternating refinement relations
    • Proc. of CONCUR'98, of, Springer-Verlag
    • R. Alur, T.A. Henzinger, O. Kupferman, and M.Y. Vardi. Alternating refinement relations. In Proc. of CONCUR'98, vol. 1466 of LNCS, pp. 163-178. Springer-Verlag, 1998.
    • (1998) LNCS , vol.1466 , pp. 163-178
    • Alur, R.1    Henzinger, T.A.2    Kupferman, O.3    Vardi, M.Y.4
  • 6
    • 0019112115 scopus 로고
    • On the temporal analysis of fairness
    • ACM Press
    • D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In POPL '80, pp. 163-173, 1980. ACM Press.
    • (1980) POPL '80 , pp. 163-173
    • Gabbay, D.1    Pnueli, A.2    Shelah, S.3    Stavi, J.4
  • 7
    • 0036565545 scopus 로고    scopus 로고
    • Dynamic coalition formation among rational agents
    • M. Klusch and A. Gerber. Dynamic coalition formation among rational agents. IEEE Int. Syst., 17(3):42-47, 2002.
    • (2002) IEEE Int. Syst , vol.17 , Issue.3 , pp. 42-47
    • Klusch, M.1    Gerber, A.2
  • 11
    • 0000685151 scopus 로고    scopus 로고
    • Distributed rational decision making
    • G. Weiß, editor, The MIT Press: Cambridge, MA
    • T. Sandholm. Distributed rational decision making. In G. Weiß, editor, Multiagent Systems, pages 201-258. The MIT Press: Cambridge, MA, 1999.
    • (1999) Multiagent Systems , pp. 201-258
    • Sandholm, T.1
  • 13
    • 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, 101(1-2): 165-200, 1998.
    • (1998) Artificial Intelligence , vol.101 , Issue.1-2 , pp. 165-200
    • Shehory, O.1    Kraus, S.2
  • 14
    • 0022092438 scopus 로고
    • The complexity of prepositional linear temporal logics
    • A. P. Sistla and E. M. Clarke. The complexity of prepositional linear temporal logics. Journal of the ACM, 32(3):733-749, 1985.
    • (1985) Journal of the ACM , vol.32 , Issue.3 , pp. 733-749
    • Sistla, A.P.1    Clarke, E.M.2
  • 15
    • 3142697097 scopus 로고    scopus 로고
    • On the computational complexity of qualitative coalitional games
    • M. Wooldridge and P. E. Dunne. On the computational complexity of qualitative coalitional games. Artificial Intelligence, 158(1):27-73, 2004.
    • (2004) Artificial Intelligence , vol.158 , Issue.1 , pp. 27-73
    • Wooldridge, M.1    Dunne, P.E.2


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