Some results on multiagent algorithms in social computing context

Abstract

We study the multiagent algorithmic problem that was introduced in [3] and is called Rational Agents at the Marketplace. Some multiagent algorithms for these problems were previously suggested and manually proved in [3]. Some results about information exchange were studied in [4]. This time we address a social issue of agent anonymity and privacy in these algorithms and also affirm previous results related to information exchange.