Group reasoning in social environments

Acar, Erman ; Greco, Gianluigi ; Manna, Marco

AcarAAMAS17.pdf - Accepted

Download (1MB)

Additional URL:
URN: urn:nbn:de:bsz:180-madoc-418370
Document Type: Conference or workshop publication
Year of publication: 2017
Book title: AAMAS '17 Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems : Sao Paulo, Brazil, May 8 - 12, 2017
Page range: 1296-1304
Conference title: AAMAS 2017, 16th International Conference on Autonomous Agents and Multiagent System
Location of the conference venue: Sao Paulo, Brazil
Date of the conference: May 8-12, 2017
Publisher: Das, Sanmay
Place of publication: Richland, SC
Publishing house: International Foundation for Autonomous Agents and Multiagent Systems
Related URLs:
Publication language: English
Institution: School of Business Informatics and Mathematics > Practical Computer Science II: Artificial Intelligence (Stuckenschmidt 2009-)
Subject: 004 Computer science, internet
Keywords (English): Nash equilibrium , Dynamics , Computational Complexity , Logical agents
Abstract: While modeling group decision making scenarios, the existence of a central authority is often assumed which is in charge of amalgamating the preferences of a given set of agents with the aim of computing a socially desirable outcome, for instance, maximizing the utilitarian or the egalitarian social welfare. Departing from this classical perspective and inspired by the growing body of literature on opinion formation and diffusion, a setting for group decision making is studied where agents are selfishly interested and where each of them can adopt her own decision without a central coordination, hence possibly disagreeing with the decision taken by some of the other agents. In particular, it is assumed that agents belong to a social environment and that their preferences on the available alternatives can be influenced by the number of “neighbors” agree- ing/disagreeing with them. The setting is formalized and studied by modeling agents’ reasoning capabilities in terms of weighted propositional logics and by focusing on Nash-stable solutions as the prototypical solution concept. In particular, a thoroughly computational complexity analysis is conducted on the problem of deciding the existence of such stable outcomes. Moreover, for the classes of environments where stability is always guaranteed, the convergence of Nash dynamics consisting of sequences of best response updates is studied, too.

Dieser Eintrag ist Teil der Universitätsbibliographie.

Das Dokument wird vom Publikationsserver der Universitätsbibliothek Mannheim bereitgestellt.

Metadata export


+ Search Authors in

+ Download Statistics

Downloads per month over past year

View more statistics

You have found an error? Please let us know about your desired correction here: E-Mail

Actions (login required)

Show item Show item