Simulating the conflict between reputation and profitability for online rating portals

We simulate the process of possible interactions between a set of competitive services and a set of portals that provide online rating for these services. We argue that to have a profitable business, these portals are forced to have subscribed services that are rated by the portals. To satisfy the subscribing services, we make the assumption that the portals improve the rating of a given service by one unit per transaction that involves payment. In this study we follow the 'what-if' methodology, analysing strategies that a service may choose from to select the best portal for it to subscribe to, and strategies for a portal to accept the subscription such that its reputation loss, in terms of the integrity of its ratings, is minimised. We observe that the behaviour of the simulated agents in accordance to our model is quite natural from the real-would perspective. One conclusion from the simulations is that under reasonable conditions, if most of the services and rating portals in a given industry do not accept a subscription policy similar to the one indicated above, they will lose, respectively, their ratings and reputations, and, moreover the rating portals will have problems in making a profit. Our prediction is that the modern portal-rating based economy sector will eventually evolve into a subscription process similar to the one we suggest in this study, as an alternative to a business model based purely on advertising

A macroscopic analytical model of collaboration in distributed robotic systems

In this article, we present a macroscopic analytical model of collaboration in a group of reactive robots. The model consists of a series of coupled differential equations that describe the dynamics of group behavior. After presenting the general model, we analyze in detail a case study of collaboration, the stick-pulling experiment, studied experimentally and in simulation by Ijspeert et al. [Autonomous Robots, 11, 149-171]. The robots' task is to pull sticks out of their holes, and it can be successfully achieved only through the collaboration of two robots. There is no explicit communication or coordination between the robots. Unlike microscopic simulations (sensor-based or using a probabilistic numerical model), in which computational time scales with the robot group size, the macroscopic model is computationally efficient, because its solutions are independent of robot group size. Analysis reproduces several qualitative conclusions of Ijspeert et al.: namely, the different dynamical regimes for different values of the ratio of robots to sticks, the existence of optimal control parameters that maximize system performance as a function of group size, and the transition from superlinear to sublinear performance as the number of robots is increased

Coalition Formation and Combinatorial Auctions; Applications to Self-organization and Self-management in Utility Computing

In this paper we propose a two-stage protocol for resource management in a hierarchically organized cloud. The first stage exploits spatial locality for the formation of coalitions of supply agents; the second stage, a combinatorial auction, is based on a modified proxy-based clock algorithm and has two phases, a clock phase and a proxy phase. The clock phase supports price discovery; in the second phase a proxy conducts multiple rounds of a combinatorial auction for the package of services requested by each client. The protocol strikes a balance between low-cost services for cloud clients and a decent profit for the service providers. We also report the results of an empirical investigation of the combinatorial auction stage of the protocol.Comment: 14 page

A Multi-Agent Method for Forming and Dynamic Restructuring of Pareto Optimal Coalitions

International audienceThe first part of this paper presents a coalition formation method for multi-agent systems which finds a Pareto optimal solution without aggregating the preferences of the agents. This protocol is adapted to problems requiring coordination by coalition formation, where it is undesirable, or not possible, to aggregate the preferences of the agents. The second part proposes an extension of this method enabling dynamic restructuring of coalitions when changes occur in the system

Dynamics of a rate equation describing cluster-size evolution

AbstractIn this paper, we show dynamics of Smoluchowski's rate equation which has been widely applied to studies of aggregation processes (i.e., the evolution of cluster-size distribution) in physics. We introduce dissociation in the rate equation while dissociation is neglected in previous works. We prove the positiveness of solutions of the equation, which is a basic guarantee for the effectiveness of the model since the possibility that some solution may be negative is excluded. For the case of cluster coalesce without dissociation, we show both the equilibrium uniqueness and the equilibrium stability under the condition that the monomer deposition stops. For the case that clusters evolve with dissociation and there is no monomer deposition, we show the equilibrium uniqueness and prove the equilibrium stability if the maximum cluster size is not larger than three while we show the equilibrium stability by numerical simulations if the maximum size is larger than three

From Marriages to Coalitions: A Soft CSP Approach

In this workwerepresent the Optimal Stable Marriage problem as a Soft Constraint Satisfaction Problem. In addition, we extend this problem from couples of individuals to coalitions of generic agents, in order to define new coalition-formation principles and stability conditions. In the coalition case, we suppose the preference value as a trust score, since trust can describe a nodes belief in another nodes capabilities, honesty and reliability. Soft constraints represent a general and expressive framework that is able to deal with distinct concepts of optimality by only changing the related c-semiring structure, instead of using di erent ad-hoc algorithms. At last, we propose an implementation of the classical OSM problem by using Integer Linear Programming tools