Reference : A Satisficing Agreements Model
Scientific congresses, symposiums and conference proceedings : Paper published in a journal
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/24948
A Satisficing Agreements Model
English
Boella, Guido [> >]
Pigozzi, Gabriella [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Slavkovik, Marija [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
van der Torre, Leon mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
2011
Proceedings of the 13th International Workshop on Coordination, Organization, Institutions and Norms (COIN@WI-IAT)
Yes
International
978-1-4577-1373-6
Proceedings of the 13th International Workshop on Coordination, Organization, Institutions and Norms (COIN@WI-IAT)
2011
Lyon
France
[en] agreement reaching ; satisficing ; judgment aggregation
[en] Satisficing, the concept proposed by Herbert Simon, as an approach to reaching agreements is little explored. We propose a model for satisficing agreement reaching for an adaptive collaborative group of agents. The group consists of one human agent familiar with the problem and arbitrarily many artificial agents. Our model raises to the team level the recognition-primed decision model constructed in the field of cognitive decision-making by using social choice for reaching group opinions.
http://hdl.handle.net/10993/24948
10.1109/WI-IAT.2011.232
http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6040691&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D6040691
The original publication is available at http://ieeexplore.ieee.org

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
blank.pdfPublisher postprint10.85 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.