메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 132-141

Query incentive networks

Author keywords

[No Author keywords available]

Indexed keywords

BRANCHING PROCESS; FILE SHARING SYSTEM; NASH EQUILIBRIUM; QUERY INCENTIVE NETWORKS;

EID: 33748615434     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.63     Document Type: Conference Paper
Times cited : (104)

References (30)
  • 5
    • 33744911047 scopus 로고    scopus 로고
    • The boolean functions computed by random boolean formulas OR how to grow the right function
    • TR-2003-02
    • A. Brodsky and N. Pippenger. The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function. UBC Computer Science Technical Report, TR-2003-02, 2003.
    • (2003) UBC Computer Science Technical Report
    • Brodsky, A.1    Pippenger, N.2
  • 10
    • 4043175816 scopus 로고    scopus 로고
    • A survey of models of network formation: Stability and efficiency
    • G. Demange and M. Wooders, eds. Cambridge
    • M. Jackson. A Survey of Models of Network Formation: Stability and Efficiency. In Group Formation in Economics: Networks, Clubs and Coalitions. G. Demange and M. Wooders, eds. Cambridge, 2004.
    • (2004) Group Formation in Economics: Networks, Clubs and Coalitions
    • Jackson, M.1
  • 13
    • 0031103689 scopus 로고    scopus 로고
    • ReferralWeb: Combining social networks and collaborative filtering
    • H. Kautz, B. Selman and M. Shah. ReferralWeb: Combining Social Networks and Collaborative Filtering. Communications of the ACM, 1997.
    • (1997) Communications of the ACM
    • Kautz, H.1    Selman, B.2    Shah, M.3
  • 22
    • 0032236284 scopus 로고    scopus 로고
    • Asymptotic behavior of the extinction probabilities for stopped branching processes
    • B.A. Sevastyanov. Asymptotic Behavior of the Extinction Probabilities for Stopped Branching Processes. Theory Prob. Appl. 43(2):315-322, 1999.
    • (1999) Theory Prob. Appl. , vol.43 , Issue.2 , pp. 315-322
    • Sevastyanov, B.A.1
  • 24
    • 0000378392 scopus 로고
    • Short monotone formulae for the majority function
    • L.G. Valiant. Short monotone formulae for the majority function. Journal of Algorithms, 5:363-366, 1984.
    • (1984) Journal of Algorithms , vol.5 , pp. 363-366
    • Valiant, L.G.1
  • 27
    • 1142288433 scopus 로고    scopus 로고
    • The three ages of internet studies: Ten, five and zero years ago
    • B. Wellman. The Three Ages of Internet Studies: Ten, Five and Zero Years Ago. New Media and Society, 6(1):123-129, 2004.
    • (2004) New Media and Society , vol.6 , Issue.1 , pp. 123-129
    • Wellman, B.1


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