Some results on multiagent algorithms in social computing/software context

Aizhan Satekbayeva, Nikolai Shilov

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Distributed system is a group of decentralized interacting executers. Distributed algorithm is the communication protocol for a distributed system that transforms the group into a team to solve some task. Multiagent system is a distributed system that consists of autonomous reactive agents, i.e. executers which internal states can be characterized in socio-human terms Believes (B), Desires (D), and Intentions (I). Multiagent algorithm is a distributed algorithm for a multiagent system. In this paper we consider two examples of multiagent algorithmic problem in Social Software context. The first example is called Rational Agents at the Marketplace or Cut Cake1 Problem, the second example is called Mars Robot Puzzle. Some multiagent algorithms for these problems were previously suggested and verified by N. Garanina and N. Shilov in 2011, some results about information exchange were studied by A. Bernstein also in 2011. This time we address a social issue of agent anonymity and privacy in these algorithms and also enforce previous results related to information exchange.

Original languageEnglish
Pages (from-to)229-240
Number of pages12
JournalInformation
Volume17
Issue number1
Publication statusPublished - 2014
Externally publishedYes

Keywords

  • Algorithm verification
  • Anonymity
  • Assignment problem
  • Multiagent systems and algorithms
  • Privacy
  • Safety and progress properties
  • Social Computing
  • Social Software

ASJC Scopus subject areas

  • General

Fingerprint Dive into the research topics of 'Some results on multiagent algorithms in social computing/software context'. Together they form a unique fingerprint.

  • Cite this

    Satekbayeva, A., & Shilov, N. (2014). Some results on multiagent algorithms in social computing/software context. Information, 17(1), 229-240.