메뉴 건너뛰기




Volumn 4858 LNCS, Issue , 2007, Pages 257-268

Mechanism design on trust networks

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; CONSTRAINT THEORY; SET THEORY; SOFTWARE AGENTS;

EID: 38449109832     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77105-0_25     Document Type: Conference Paper
Times cited : (37)

References (13)
  • 6
    • 0032108328 scopus 로고    scopus 로고
    • A threshold of In n for approximating set cover
    • Feige, U.: A threshold of In n for approximating set cover. J.ACM 45, 634-652 (1998)
    • (1998) J.ACM , vol.45 , pp. 634-652
    • Feige, U.1
  • 9
    • 0037258594 scopus 로고    scopus 로고
    • Combinatorial information market design
    • Hanson, R.D.: Combinatorial information market design. Information Systems Frontiers 5(1), 107-119 (2003)
    • (2003) Information Systems Frontiers , vol.5 , Issue.1 , pp. 107-119
    • Hanson, R.D.1
  • 10
    • 38449094322 scopus 로고    scopus 로고
    • Logarithmic market scoring rules for modular combinatorial information aggregation
    • Hanson, R.D.: Logarithmic market scoring rules for modular combinatorial information aggregation. Journal of Prediction Markets 1(1), 1-15 (2007)
    • (2007) Journal of Prediction Markets , vol.1 , Issue.1 , pp. 1-15
    • Hanson, R.D.1


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