Optimizing agent-based negotiations with branch-and-bound

Andy Hon Wai Chun; Rebecca Y.M. Wong

doi:10.1007/3-540-45336-9_28

Optimizing agent-based negotiations with branch-and-bound

Andy Hon Wai Chun
, Rebecca Y.M. Wong

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

1 Citation (Scopus)

Abstract

This paper presents an algorithm called Nstar (N*) that performs optimizing agent-based negotiation. N* borrows concepts from branch-andbound and A* optimal search algorithms. The N* negotiation algorithm can be used for a general class of negotiation problems that requires consensus among two or more collaborating agents. N* schedules events through a negotiation protocol that mimics a process of proposing and counter proposing. It makes use of an evaluation function that represents an underestimation of the "global" preference for a particular proposal. This preference is computed based on a user preference model. An optimal solution is found when there is a compromise and the evaluation function is maximized. © Springer-Verlag Berlin Heidelberg 2001

Original language	English
Title of host publication	Active Media Technology
Subtitle of host publication	6th International Computer Science Conference, AMT 2001, Hong Kong, China, December 18-20, 2001. Proceedings
Editors	Jiming Liu, Pong C. Yuen, Chun-hung Li, Joseph Ng, Toru Ishida
Publisher	Springer
Pages	235-243
Volume	Berlin, Heidelberg
ISBN (Electronic)	978-3-540-45336-9
ISBN (Print)	9783540430353
DOIs	https://doi.org/10.1007/3-540-45336-9_28
Publication status	Published - 2001
Event	6th International Computer Science Conference on Active Media Technology (AMT 2001) - Hong Kong, China Duration: 18 Dec 2001 → 20 Dec 2001

Publication series

Name	Lecture Notes in Computer Science
Volume	2252
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	6th International Computer Science Conference on Active Media Technology (AMT 2001)
Place	China
City	Hong Kong
Period	18/12/01 → 20/12/01

Access Output

10.1007/3-540-45336-9_28

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

Chun, A. H. W., & Wong, R. Y. M. (2001). Optimizing agent-based negotiations with branch-and-bound. In J. Liu, P. C. Yuen, C. Li, J. Ng, & T. Ishida (Eds.), Active Media Technology: 6th International Computer Science Conference, AMT 2001, Hong Kong, China, December 18-20, 2001. Proceedings (Vol. Berlin, Heidelberg, pp. 235-243). (Lecture Notes in Computer Science; Vol. 2252). Springer . https://doi.org/10.1007/3-540-45336-9_28

Chun, Andy Hon Wai ; Wong, Rebecca Y.M. / Optimizing agent-based negotiations with branch-and-bound. Active Media Technology: 6th International Computer Science Conference, AMT 2001, Hong Kong, China, December 18-20, 2001. Proceedings. editor / Jiming Liu ; Pong C. Yuen ; Chun-hung Li ; Joseph Ng ; Toru Ishida. Vol. Berlin, Heidelberg Springer , 2001. pp. 235-243 (Lecture Notes in Computer Science).

@inproceedings{360f588d417c4cc88c12880dd88b53a1,

title = "Optimizing agent-based negotiations with branch-and-bound",

abstract = "This paper presents an algorithm called Nstar (N*) that performs optimizing agent-based negotiation. N* borrows concepts from branch-andbound and A* optimal search algorithms. The N* negotiation algorithm can be used for a general class of negotiation problems that requires consensus among two or more collaborating agents. N* schedules events through a negotiation protocol that mimics a process of proposing and counter proposing. It makes use of an evaluation function that represents an underestimation of the {"}global{"} preference for a particular proposal. This preference is computed based on a user preference model. An optimal solution is found when there is a compromise and the evaluation function is maximized. {\textcopyright} Springer-Verlag Berlin Heidelberg 2001",

author = "Chun, \{Andy Hon Wai\} and Wong, \{Rebecca Y.M.\}",

year = "2001",

doi = "10.1007/3-540-45336-9\_28",

language = "English",

isbn = "9783540430353",

volume = "Berlin, Heidelberg",

series = "Lecture Notes in Computer Science",

publisher = "Springer ",

pages = "235--243",

editor = "Jiming Liu and Yuen, \{Pong C.\} and Chun-hung Li and Joseph Ng and Toru Ishida",

booktitle = "Active Media Technology",

note = "6th International Computer Science Conference on Active Media Technology (AMT 2001) ; Conference date: 18-12-2001 Through 20-12-2001",

}

Chun, AHW & Wong, RYM 2001, Optimizing agent-based negotiations with branch-and-bound. in J Liu, PC Yuen, C Li, J Ng & T Ishida (eds), Active Media Technology: 6th International Computer Science Conference, AMT 2001, Hong Kong, China, December 18-20, 2001. Proceedings. vol. Berlin, Heidelberg, Lecture Notes in Computer Science, vol. 2252, Springer , pp. 235-243, 6th International Computer Science Conference on Active Media Technology (AMT 2001), Hong Kong, China, 18/12/01. https://doi.org/10.1007/3-540-45336-9_28

Optimizing agent-based negotiations with branch-and-bound. / Chun, Andy Hon Wai; Wong, Rebecca Y.M.
Active Media Technology: 6th International Computer Science Conference, AMT 2001, Hong Kong, China, December 18-20, 2001. Proceedings. ed. / Jiming Liu; Pong C. Yuen; Chun-hung Li; Joseph Ng; Toru Ishida. Vol. Berlin, Heidelberg Springer , 2001. p. 235-243 (Lecture Notes in Computer Science; Vol. 2252).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Optimizing agent-based negotiations with branch-and-bound

AU - Chun, Andy Hon Wai

AU - Wong, Rebecca Y.M.

PY - 2001

Y1 - 2001

N2 - This paper presents an algorithm called Nstar (N*) that performs optimizing agent-based negotiation. N* borrows concepts from branch-andbound and A* optimal search algorithms. The N* negotiation algorithm can be used for a general class of negotiation problems that requires consensus among two or more collaborating agents. N* schedules events through a negotiation protocol that mimics a process of proposing and counter proposing. It makes use of an evaluation function that represents an underestimation of the "global" preference for a particular proposal. This preference is computed based on a user preference model. An optimal solution is found when there is a compromise and the evaluation function is maximized. © Springer-Verlag Berlin Heidelberg 2001

AB - This paper presents an algorithm called Nstar (N*) that performs optimizing agent-based negotiation. N* borrows concepts from branch-andbound and A* optimal search algorithms. The N* negotiation algorithm can be used for a general class of negotiation problems that requires consensus among two or more collaborating agents. N* schedules events through a negotiation protocol that mimics a process of proposing and counter proposing. It makes use of an evaluation function that represents an underestimation of the "global" preference for a particular proposal. This preference is computed based on a user preference model. An optimal solution is found when there is a compromise and the evaluation function is maximized. © Springer-Verlag Berlin Heidelberg 2001

UR - https://www.scopus.com/pages/publications/84931832404

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84931832404&origin=recordpage

U2 - 10.1007/3-540-45336-9_28

DO - 10.1007/3-540-45336-9_28

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9783540430353

VL - Berlin, Heidelberg

T3 - Lecture Notes in Computer Science

SP - 235

EP - 243

BT - Active Media Technology

A2 - Liu, Jiming

A2 - Yuen, Pong C.

A2 - Li, Chun-hung

A2 - Ng, Joseph

A2 - Ishida, Toru

PB - Springer

T2 - 6th International Computer Science Conference on Active Media Technology (AMT 2001)

Y2 - 18 December 2001 through 20 December 2001

ER -

Chun AHW, Wong RYM. Optimizing agent-based negotiations with branch-and-bound. In Liu J, Yuen PC, Li C, Ng J, Ishida T, editors, Active Media Technology: 6th International Computer Science Conference, AMT 2001, Hong Kong, China, December 18-20, 2001. Proceedings. Vol. Berlin, Heidelberg. Springer . 2001. p. 235-243. (Lecture Notes in Computer Science). doi: 10.1007/3-540-45336-9_28

Optimizing agent-based negotiations with branch-and-bound

Abstract

Publication series

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this