Automated Negotiation for Complex Multi-Agent Resource Allocation

The problem of constructing and analyzing systems of intelligent, autonomous agents is becoming more and more important. These agents may include people, physical robots, virtual humans, software programs acting on behalf of human beings, or sensors. In a large class of multi-agent scenarios, agents may have different capabilities, preferences, objectives, and constraints. Therefore, efficient allocation of resources among multiple agents is often difficult to achieve. Automated negotiation (bargaining) is the most widely used approach for multi-agent resource allocation and it has received increasing attention in the recent years. However, information uncertainty, existence of multiple contracting partners and competitors, agents\u27 incentive to maximize individual utilities, and market dynamics make it difficult to calculate agents\u27 rational equilibrium negotiation strategies and develop successful negotiation agents behaving well in practice. To this end, this thesis is concerned with analyzing agents\u27 rational behavior and developing negotiation strategies for a range of complex negotiation contexts. First, we consider the problem of finding agents\u27 rational strategies in bargaining with incomplete information. We focus on the principal alternating-offers finite horizon bargaining protocol with one-sided uncertainty regarding agents\u27 reserve prices. We provide an algorithm based on the combination of game theoretic analysis and search techniques which finds agents\u27 equilibrium in pure strategies when they exist. Our approach is sound, complete and, in principle, can be applied to other uncertainty settings. Simulation results show that there is at least one pure strategy sequential equilibrium in 99.7% of various scenarios. In addition, agents with equilibrium strategies achieved higher utilities than agents with heuristic strategies. Next, we extend the alternating-offers protocol to handle concurrent negotiations in which each agent has multiple trading opportunities and faces market competition. We provide an algorithm based on backward induction to compute the subgame perfect equilibrium of concurrent negotiation. We observe that agents\u27 bargaining power are affected by the proposing ordering and market competition and for a large subset of the space of the parameters, agents\u27 equilibrium strategies depend on the values of a small number of parameters. We also extend our algorithm to find a pure strategy sequential equilibrium in concurrent negotiations where there is one-sided uncertainty regarding the reserve price of one agent. Third, we present the design and implementation of agents that concurrently negotiate with other entities for acquiring multiple resources. Negotiation agents are designed to adjust 1) the number of tentative agreements and 2) the amount of concession they are willing to make in response to changing market conditions and negotiation situations. In our approach, agents utilize a time-dependent negotiation strategy in which the reserve price of each resource is dynamically determined by 1) the likelihood that negotiation will not be successfully completed, 2) the expected agreement price of the resource, and 3) the expected number of final agreements. The negotiation deadline of each resource is determined by its relative scarcity. Since agents are permitted to decommit from agreements, a buyer may make more than one tentative agreement for each resource and the maximum number of tentative agreements is constrained by the market situation. Experimental results show that our negotiation strategy achieved significantly higher utilities than simpler strategies. Finally, we consider the problem of allocating networked resources in dynamic environment, such as cloud computing platforms, where providers strategically price resources to maximize their utility. While numerous auction-based approaches have been proposed in the literature, our work explores an alternative approach where providers and consumers negotiate resource leasing contracts. We propose a distributed negotiation mechanism where agents negotiate over both a contract price and a decommitment penalty, which allows agents to decommit from contracts at a cost. We compare our approach experimentally, using representative scenarios and workloads, to both combinatorial auctions and the fixed-price model, and show that the negotiation model achieves a higher social welfare

Bid-Price Control for Energy-Aware Pricing of Cloud Services

The amount of electrical energy consumed by Cloud computing resources keeps rising continuously. To exploit the full potential of reducing the carbon footprint, technical optimization of data center load and cooling distribution is not sufficient. We propose a method that motivates Cloud service providers to invest in energy-efficient infrastructure, which then allows for increasing revenue. The differentiation between conventional and green services offers the possibility to apply price discrimination approaches known from Revenue Management literature. Applying bid-price controlled pricing for the provider\u27s decision on accepting an incoming request bears the potential of increased revenue. We demonstrate the efficacy of the developed artifact through an experimental evaluation for various settings of supply and demand

Energy-aware Service Allocation for Cloud Computing

Energy efficiency has become an important managerial variable of IT management. Whereas cloud computing promises significantly higher levels of energy efficiency, it is still not known, if and to what extent outsourcing of software applications to cloud service providers affects the overall energy efficiency. This research is concerned with the allocation of cloud services from providers to customers and addresses the problem of energy-aware service allocation. The distributed nature of the problem, i.e., the multiple loci of control, entails the failure of centralised solutions. Hence, we approach this problem from a multiagent system perspective, which preserves the distributed setting of multiple service providers and customers. The contribution of our research is a game-theoretic framework for analysing service provider and customer interactions and a novel distributed allocation mechanism based on this framework to approximate energy-efficient, optimal allocations. We demonstrate the usefulness and efficacy of the proposed artifact in several simulation experiments

Strategies of Mobile Agents on Malicious Clouds

Cloud computing is a service model enabling resources limited mobile devices to remotely execute tasks on the clouds. The Mobile Agent is a software program on behalf of the software installed in the mobile device to negotiate with other mobile agents in the clouds, which provides a diversity of automated negotiation based applications in Mobile Commences. However, the negotiation plans carried by mobile agents are easily be eavesdropped by the malicious cloud platforms, since the codes of mobile agents are read and executed on the cloud platform. Thus, the sellers can take cheat actions to increase their profits, which is to tailor the negotiation plans to seize buyers’ profits after eavesdropping on buyers’ negotiation plans. In this paper, we consider the buyers can take actions to resist the sellers’ cheatings, that is the buyers can tailor their plans with extremely low demands before migrate to the cloud platform. Above situations are modeled as a mathematical model, called the Eavesdropping and Resistance of Negotiation (ERN) Game. We develop a simulator to simulate an artificial market for analyzing the behaviors on ERN Game. The simulation results show buyers’ resistances deter sellers from cheating and cooperative strategies are adopted by buyers and sellers

Self-adaptation-based dynamic coalition formation in a distributed agent network: a mechanism and a brief survey

In some real systems, e.g., distributed sensor networks, individual agents often need to form coalitions to accomplish complex tasks. Due to communication and computation constraints, it is infeasible for agents to directly interact with all other agents to form coalitions. Most previous coalition formation studies, however, overlooked this aspect. Those studies did not provide an explicitly modeled agent network or assumed that agents were in a fully connected network, where an agent can directly communicate with all other agents. Thus, to alleviate this problem, it is necessary to provide a neighborhood network structure, within which agents can directly interact only with their neighbors. Toward this end, in this paper, a self-adaptation-based dynamic coalition formation mechanism is proposed. The proposed mechanism operates in a neighborhood agent network. Based on self-adaptation principles, this mechanism enables agents to dynamically adjust their degrees of involvement in multiple coalitions and to join new coalitions at any time. The self-adaptation process, i.e., agents adjusting their degrees of involvement in multiple coalitions, is realized by exploiting a negotiation protocol. The proposed mechanism is evaluated through a comparison with a centralized mechanism (CM) and three other coalition formation mechanisms. Experimental results demonstrate the good performance of the proposed mechanism in terms of the entire network profit and time consumption. Additionally, a brief survey of current coalition formation research is also provided. From this survey, readers can have a general understanding of the focuses and progress of current research. This survey provides a classification of the primary emphasis of each related work in coalition formation, so readers can conveniently find the most related studies

On-demand or Spot? Selling the cloud to risk-averse customers

In Amazon EC2, cloud resources are sold through a combination of an on-demand market, in which customers buy resources at a fixed price, and a spot market, in which customers bid for an uncertain supply of excess resources. Standard market environments suggest that an optimal design uses just one type of market. We show the prevalence of a dual market system can be explained by heterogeneous risk attitudes of customers. In our stylized model, we consider unit demand risk-averse bidders. We show the model admits a unique equilibrium, with higher revenue and higher welfare than using only spot markets. Furthermore, as risk aversion increases, the usage of the on-demand market increases. We conclude that risk attitudes are an important factor in cloud resource allocation and should be incorporated into models of cloud markets.Comment: Appeared at WINE 201

Agent-Based System Design for Service Process Scheduling: Challenges, Approaches and Opportunities

Compared with traditional manufacturing scheduling, service process scheduling poses additional challenges attributable to the significant customer involvement in service processes. In services, there are typically no inventoried products, which make the service provider's capacity more sensitive to dynamic changes. Service process scheduling objectives are also more complicated due to the consideration of customer preferences, customer waiting costs and human resource costs. After describing the Unified Services Theory and analysing its scheduling implications, this paper reviews the research literature on service process scheduling system design with a particular emphasis on agent-based approaches. Major issues in agent-based service process scheduling systems design are discussed and research opportunities are identified. The survey of the literature reveals that despite of many domain-specific designs in agent-based service process scheduling, there is a lack of general problem formulations, classifications, solution frameworks, and test beds. Constructing these general models for service process scheduling system design will facilitate the collaboration of researchers in this area and guide the effective development of integrated service process scheduling systems

Design and implementation of a multi-agent opportunistic grid computing platform

Opportunistic Grid Computing involves joining idle computing resources in enterprises into a converged high performance commodity infrastructure. The research described in this dissertation investigates the viability of public resource computing in offering a plethora of possibilities through seamless access to shared compute and storage resources. The research proposes and conceptualizes the Multi-Agent Opportunistic Grid (MAOG) solution in an Information and Communication Technologies for Development (ICT4D) initiative to address some limitations prevalent in traditional distributed system implementations. Proof-of-concept software components based on JADE (Java Agent Development Framework) validated Multi-Agent Systems (MAS) as an important tool for provisioning of Opportunistic Grid Computing platforms. Exploration of agent technologies within the research context identified two key components which improve access to extended computer capabilities. The first component is a Mobile Agent (MA) compute component in which a group of agents interact to pool shared processor cycles. The compute component integrates dynamic resource identification and allocation strategies by incorporating the Contract Net Protocol (CNP) and rule based reasoning concepts. The second service is a MAS based storage component realized through disk mirroring and Google file-system’s chunking with atomic append storage techniques. This research provides a candidate Opportunistic Grid Computing platform design and implementation through the use of MAS. Experiments conducted validated the design and implementation of the compute and storage services. From results, support for processing user applications; resource identification and allocation; and rule based reasoning validated the MA compute component. A MAS based file-system that implements chunking optimizations was considered to be optimum based on evaluations. The findings from the undertaken experiments also validated the functional adequacy of the implementation, and show the suitability of MAS for provisioning of robust, autonomous, and intelligent platforms. The context of this research, ICT4D, provides a solution to optimizing and increasing the utilization of computing resources that are usually idle in these contexts

MAS-based self-adaptive architecture for controlling and monitoring Cloud platforms

The theory of agents and multiagent systems can provide a new model for managing Cloud Computing systems based on the distribution of responsibilities, flexibility and autonomy. Managing the functions of the nucleus of a CC system through an agent-based model allows the resulting platforms to be much more efficient, scalable and adaptable than they currently are. This article presents an architecture to model the control and monitoring system of a Cloud Computing platform by using a Virtual Organization of intelligent agents that self-adapt and reorganize according to the needs of the surrounding environment

An adaptive multi-agent system for task reallocation in a MapReduce job

International audienceWe study the problem of task reallocation for load-balancing of MapReduce jobs in applications that process large datasets. In this context, we propose a novel strategy based on cooperative agents used to optimise the task scheduling in a single MapReduce job. The novelty of our strategy lies in the ability of agents to identify opportunities within a current unbalanced allocation, which in turn trigger concurrent and one-to-many negotiations amongst agents to locally reallocate some of the tasks within a job. Our contribution is that tasks are reallocated according to the proximity of the resources and they are performed in accordance to the capabilities of the nodes in which agents are situated. To evaluate the adaptivity and responsiveness of our approach, we implement a prototype test-bed and conduct a vast panel of experiments in a heterogeneous environment and by exploring varying hardware configurations. This extensive experimentation reveals that our strategy significantly improves the overall runtime over the classical Hadoop data processing