메뉴 건너뛰기




Volumn , Issue , 2003, Pages 278-279

Incentive compatible open constraint optimization

Author keywords

Constraint satisfaction; Optimization

Indexed keywords

CONSTRAINT THEORY; INFORMATION RETRIEVAL; INFORMATION SERVICES; ONLINE SYSTEMS; OPTIMIZATION;

EID: 0242539803     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/779950.779998     Document Type: Conference Paper
Times cited : (3)

References (4)
  • 1
    • 0032596636 scopus 로고    scopus 로고
    • Encodings of non-binary constraint satisfaction problems
    • Stergiou, K. and Walsh, T.: "Encodings of Non-Binary Constraint Satisfaction Problems," Proceedings of the AAAI '99, pp. 163-168, 1999
    • (1999) Proceedings of the AAAI '99 , pp. 163-168
    • Stergiou, K.1    Walsh, T.2
  • 2
    • 0036932447 scopus 로고    scopus 로고
    • Partial-revelation VCG mechanism for combinatorial auctions
    • W. Conen, T. Sandholm: "Partial-revelation VCG Mechanism for Combinatorial Auctions," Proceedings of the AAAI-02, pp. 367-372, 2002
    • (2002) Proceedings of the AAAI-02 , pp. 367-372
    • Conen, W.1    Sandholm, T.2


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