메뉴 건너뛰기




Volumn 1, Issue , 2007, Pages 72-78

Partial revelation automated mechanism design

Author keywords

[No Author keywords available]

Indexed keywords

MULTI AGENT SYSTEMS; OPTIMIZATION;

EID: 36348939301     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (4)

References (11)
  • 2
    • 33646096015 scopus 로고    scopus 로고
    • Constraint-based optimization and utility elicitation using the minimax decision criterion
    • C. Boutilier, R. Patrascu, P. Poupart, and D. Schuurmans. Constraint-based optimization and utility elicitation using the minimax decision criterion. Artificial Intelligence, 170:686-713, 2006.
    • (2006) Artificial Intelligence , vol.170 , pp. 686-713
    • Boutilier, C.1    Patrascu, R.2    Poupart, P.3    Schuurmans, D.4
  • 3
    • 4544288246 scopus 로고    scopus 로고
    • Complexity of mechanism design
    • Edmonton
    • V. Conitzer and T. Sandholm. Complexity of mechanism design. In UAI-02, pp. 103-110, Edmonton, 2002.
    • (2002) UAI-02 , pp. 103-110
    • Conitzer, V.1    Sandholm, T.2
  • 4
    • 33750685978 scopus 로고    scopus 로고
    • Regret-based incremental partial revelation mechanisms
    • Boston, USA
    • N. Hyafil and C. Boutilier. Regret-based incremental partial revelation mechanisms. In AAAI-06, pp. 672-678, Boston, USA, 2006.
    • (2006) AAAI-06 , pp. 672-678
    • Hyafil, N.1    Boutilier, C.2
  • 5
    • 36348980681 scopus 로고    scopus 로고
    • One-shot mechanism design with partial revelation
    • Hyderabad, India
    • N. Hyafil and C. Boutilier. One-shot mechanism design with partial revelation. In IJCAI-07, pp. 1333-1340, Hyderabad, India, 2007.
    • (2007) IJCAI-07 , pp. 1333-1340
    • Hyafil, N.1    Boutilier, C.2
  • 8
    • 33744990197 scopus 로고    scopus 로고
    • The communication requirements of efficient allocations and supporting prices
    • N. Nisan and I. Segal. The communication requirements of efficient allocations and supporting prices. J. Economic Theory, 129:192-224, 2006.
    • (2006) J. Economic Theory , vol.129 , pp. 192-224
    • Nisan, N.1    Segal, I.2
  • 9
    • 0002259166 scopus 로고
    • The characterization of implementable choice rules
    • J.J. Laffont, ed, Amsterdam
    • K. Roberts. The characterization of implementable choice rules. In J.J. Laffont, ed., Aggregation and Revelation of Preferences, pp. 321-349. Amsterdam, 1979.
    • (1979) Aggregation and Revelation of Preferences , pp. 321-349
    • Roberts, K.1
  • 10
    • 36349004966 scopus 로고    scopus 로고
    • Automated design of multistage mechanisms
    • Hyderabad, India
    • T. Sandholm, V. Conitzer, and C. Boutilier. Automated design of multistage mechanisms. In IJCAI-07, pp. 1500-1506, Hyderabad, India, 2007.
    • (2007) IJCAI-07 , pp. 1500-1506
    • Sandholm, T.1    Conitzer, V.2    Boutilier, C.3
  • 11
    • 33845193715 scopus 로고    scopus 로고
    • Hard-to-manipulate combinatorial auctions
    • Tech. report, Harvard Univ, Boston, MA
    • S. Sanghvi and D. Parkes. Hard-to-manipulate combinatorial auctions. Tech. report, Harvard Univ., Boston, MA, 2004.
    • (2004)
    • Sanghvi, S.1    Parkes, D.2


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