메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1239-1244

Reaching envy-free states in distributed negotiation settings

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED NEGOTIATIONS; EFFICIENCY AND FAIRNESS;

EID: 84880877458     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (64)

References (12)
  • 1
    • 0000391433 scopus 로고
    • Fair allocation of indivisible goods and criteria of justice
    • A. Alkan, G. Demange, and D. Gale. Fair allocation of indivisible goods and criteria of justice. Econometrica, 59(4):1023-1039, 1991.
    • (1991) Econometrica , vol.59 , Issue.4 , pp. 1023-1039
    • Alkan, A.1    Demange, G.2    Gale, D.3
  • 2
    • 84880712048 scopus 로고    scopus 로고
    • Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity
    • Morgan Kaufmann
    • S. Bouveret and J. Lang. Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity. In Proc. IJCAI-2005. Morgan Kaufmann, 2005.
    • (2005) Proc. IJCAI-2005
    • Bouveret, S.1    Lang, J.2
  • 4
    • 16244378908 scopus 로고    scopus 로고
    • The complexity of contract negotiation
    • DOI 10.1016/j.artint.2005.01.006, PII S0004370205000184
    • P.E. Dunne, M. Wooldridge, and M. Laurence. The complexity of contract negotiation. Artificial Intelligence, 164(1-2):23-46, 2005. (Pubitemid 40454429)
    • (2005) Artificial Intelligence , vol.164 , Issue.1-2 , pp. 23-46
    • Dunne, P.E.1    Wooldridge, M.2    Laurence, M.3
  • 7
    • 0036823698 scopus 로고    scopus 로고
    • Bidding for envy-freeness: A procedural approach to n-player fair-division problems
    • DOI 10.1007/s003550100149
    • C.-J. Haake, M.G. Raith, and F.E. Su. Bidding for envy-freeness: A procedural approach to n-player fair-division problems. Social Choice and Welfare, 19:723-749, 2002. (Pubitemid 36170780)
    • (2002) Social Choice and Welfare , vol.19 , Issue.4 , pp. 723-749
    • Haake, C.-J.1    Raith, M.G.2    Su, F.E.3
  • 8
    • 0034400294 scopus 로고    scopus 로고
    • An algorithm for envy-free allocations in an economy with indivisible objects and money
    • F. Klijn. An algorithm for envy-free allocations in an economy with indivisible objects and money. Social Choice and Welfare, 17:201-215, 2000.
    • (2000) Social Choice and Welfare , vol.17 , pp. 201-215
    • Klijn, F.1
  • 9
    • 84880734072 scopus 로고    scopus 로고
    • On approximately fair allocations of indivisible goods
    • ACM Press
    • R.J. Lipton, E. Markakis, E. Mossel, and A. Saberi. On approximately fair allocations of indivisible goods. In Proc. EC-2004. ACM Press, 2004.
    • (2004) Proc. EC-2004
    • Lipton, R.J.1    Markakis, E.2    Mossel, E.3    Saberi, A.4
  • 11
    • 0032141895 scopus 로고    scopus 로고
    • Computationally manageable combinational auctions
    • M.H. Rothkopf, A. Pekeč, and R.M. Harstad. Computationally manageable combinational auctions. Management Science, 44(8):1131-1147, 1998. (Pubitemid 128569657)
    • (1998) Management Science , vol.44 , Issue.8 , pp. 1131-1147
    • Rothkopf, M.H.1    Pekec, A.2    Harstad, R.M.3


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