Abstract
Complex negotiations are characterized by a particular type of utility spaces that is usually nonlinear and nonmonotonic. An example of such utility spaces are constraintbased utility spaces. The multitude of constraints’ shapes that could potentially be used by the negotiating agents makes any opponent modeling attempt more challenging. The same problem persists even when the agent is exploring her own utility space as to find her optimal contracts. Seeking a unified form for constraintbased utility representation might shed some light on how to tackle these problems.
In this paper, we propose to find an approximation for constraintbased preferences, used mainly in complex negotiation with nonlinear utility spaces. The proposed approximation yields a compact form that unifies a whole family of constraints (Cubic, Bell, Conic, etc.). Results show that the new canonical form can in fact be an alternative representation for all known constraintbased utility functions. Additionally, it leads us to a potential parametric model that could be used for opponent modeling in complex nonlinear negotiations.
Original language  English 

Title of host publication  PRIMA 2014 
Subtitle of host publication  Principles and Practice of MultiAgent Systems  17th International Conference, Proceedings 
Editors  Hoa Khanh Dam, Jeremy Pitt, Yang Xu, Guido Governatori, Takayuki Ito 
Place of Publication  Switzerland 
Publisher  Springer 
Pages  133140 
Number of pages  8 
ISBN (Electronic)  9783319131917 
ISBN (Print)  9783319131900 
Publication status  Published  1 Jan 2014 
Externally published  Yes 
Event  International Conference on Principles of Practice in MultiAgent Systems 2014  Gold Coast, Australia Duration: 1 Dec 2014 → 5 Dec 2014 Conference number: 17th https://link.springer.com/book/10.1007/9783319131917 (Proceedings) 
Publication series
Name  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 

Volume  8861 
ISSN (Print)  03029743 
ISSN (Electronic)  16113349 
Conference
Conference  International Conference on Principles of Practice in MultiAgent Systems 2014 

Abbreviated title  PRIMA 2014 
Country  Australia 
City  Gold Coast 
Period  1/12/14 → 5/12/14 
Internet address 

Cite this
}
Approximating constraintbased utility spaces using generalized gaussian mixture models. / Hadfi, Rafik; Ito, Takayuki.
PRIMA 2014: Principles and Practice of MultiAgent Systems  17th International Conference, Proceedings. ed. / Hoa Khanh Dam; Jeremy Pitt; Yang Xu; Guido Governatori; Takayuki Ito. Switzerland : Springer, 2014. p. 133140 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8861).Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peerreview
TY  GEN
T1  Approximating constraintbased utility spaces using generalized gaussian mixture models
AU  Hadfi, Rafik
AU  Ito, Takayuki
PY  2014/1/1
Y1  2014/1/1
N2  Complex negotiations are characterized by a particular type of utility spaces that is usually nonlinear and nonmonotonic. An example of such utility spaces are constraintbased utility spaces. The multitude of constraints’ shapes that could potentially be used by the negotiating agents makes any opponent modeling attempt more challenging. The same problem persists even when the agent is exploring her own utility space as to find her optimal contracts. Seeking a unified form for constraintbased utility representation might shed some light on how to tackle these problems.In this paper, we propose to find an approximation for constraintbased preferences, used mainly in complex negotiation with nonlinear utility spaces. The proposed approximation yields a compact form that unifies a whole family of constraints (Cubic, Bell, Conic, etc.). Results show that the new canonical form can in fact be an alternative representation for all known constraintbased utility functions. Additionally, it leads us to a potential parametric model that could be used for opponent modeling in complex nonlinear negotiations.
AB  Complex negotiations are characterized by a particular type of utility spaces that is usually nonlinear and nonmonotonic. An example of such utility spaces are constraintbased utility spaces. The multitude of constraints’ shapes that could potentially be used by the negotiating agents makes any opponent modeling attempt more challenging. The same problem persists even when the agent is exploring her own utility space as to find her optimal contracts. Seeking a unified form for constraintbased utility representation might shed some light on how to tackle these problems.In this paper, we propose to find an approximation for constraintbased preferences, used mainly in complex negotiation with nonlinear utility spaces. The proposed approximation yields a compact form that unifies a whole family of constraints (Cubic, Bell, Conic, etc.). Results show that the new canonical form can in fact be an alternative representation for all known constraintbased utility functions. Additionally, it leads us to a potential parametric model that could be used for opponent modeling in complex nonlinear negotiations.
UR  http://www.scopus.com/inward/record.url?scp=84910123259&partnerID=8YFLogxK
M3  Conference Paper
AN  SCOPUS:84910123259
SN  9783319131900
T3  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP  133
EP  140
BT  PRIMA 2014
A2  Dam, Hoa Khanh
A2  Pitt, Jeremy
A2  Xu, Yang
A2  Governatori, Guido
A2  Ito, Takayuki
PB  Springer
CY  Switzerland
ER 