A distributed protocol for collective decision-making in combinatorial domains

Minyi Li, Quoc Bao Vo, Ryszard Kowalczyk

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

Abstract

In this paper, we study the problem of collective decision-making over combinatorial domains. We focus on a particular social choice rule, namely Smith/Minimax. We introduce a distributed protocol for collective decision-making, which is general enough and does not restrict the choice of preference representation languages. The final decision chosen is guaranteed to be a Smith member, and is sufficiently close to the Smith/Minimax candidate. Moreover, it enables distributed decision-making and significantly reduces the amount of dominance testings (individual outcome comparisons) that each agent needs to conduct, as well as the number of pairwise comparisons
Original languageEnglish
Title of host publicationAAMAS 2013
Subtitle of host publicationProceedings of the 12th International Conference on Autonomous Agents & Multiagent Systems
EditorsTakayuki Ito, Catholijn Jonker
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Pages1117-1118
Number of pages2
ISBN (Print)9781450319935
Publication statusPublished - 2013
Externally publishedYes
EventInternational Conference on Autonomous Agents and Multiagent Systems 2013 - Saint Paul, United States of America
Duration: 6 May 201310 May 2013
Conference number: 12th
https://dl.acm.org/doi/proceedings/10.5555/2484920 (Proceedings)

Conference

ConferenceInternational Conference on Autonomous Agents and Multiagent Systems 2013
Abbreviated titleAAMAS 2013
Country/TerritoryUnited States of America
CitySaint Paul
Period6/05/1310/05/13
Internet address

Keywords

  • Collective decision-making
  • Smith set
  • Minimax

Cite this