A Rule-driven Approach for Defining the Behavior of Negotiating Software Agents

One problem with existing agent-mediated negotiation systems is that they rely on ad hoc, static, non-adaptive, and hardcoded schemes to represent the behaviour of agents. This limitation is probably due to the complexity of the negotiation task itself. Indeed, while negotiating, software (human) agents face tough decisions. These decisions are based not only on the information made available by the negotiation server, but on the behaviour of the other participants in the negotiation process as well. The information and the behaviour in question are constantly changing and highly uncertain. In the first part of the paper, we propose a rule-driven approach to represent, manage and explore negotiation strategies and coordination information. For that, we divide the behaviour of negotiating agents into protocols, strategies and coordination. Among the many advantages of the proposed solution, we can cite the high level of abstraction, the closeness to human understanding, the versatility, and the possibility to modify the agents' behaviour during the negotiation process. To validate our solution, we ran many agent tournaments, and used the rule-driven approach to implement bidding strategies that are common in the English and Dutch auctions. We also implemented simple coordination schemes across several auctions. The ongoing validation work is detailed and discussed in the second part of the paper. Un des inconvénients qu'on retrouve fréquemment dans les systèmes de négociation par agents est qu'ils reposent sur des schémas ad-hoc, non adaptatifs et figés dans le code pour représenter le comportement des agents. Cette limitation est probablement due à la complexité de l'activité de négociation elle-même. En effet, au cours de la négociation, les agents logiciels (humains) ont des décisions difficiles à prendre. Ces décisions ne sont pas seulement basées sur l'information disponible sur le serveur de négociation, mais aussi sur le comportement des autres participants durant le processus de négociation. L'information et le comportement en question changent constamment et sont très incertains. Dans la première partie de l'article, nous proposons une approche à base de règles pour représenter, gérer et explorer les stratégies de négociation ainsi que l'information de coordination. Parmi les nombreux avantages de la solution proposée, on peut citer le haut niveau d'abstraction, la proximité avec la compréhension humaine, la souplesse d'utilisation et la possibilité de modifier le comportement des agents durant le processus de négociation. Pour valider notre solution, nous avons effectué plusieurs tournois entre agents et utilisé l'approche à base de règles pour implémenter des stratégies simples applicables à l'enchère anglaise et à l'enchère hollandaise. Nous avons aussi implémenté des schémas simples de coordination impliquant plusieurs enchères. Le travail de validation, en cours, est détaillé et discuté dans la seconde partie de l'article.e-negotiation, online auction, software agent, negotiation strategy, coordination, rule-based system, rule engine, Négociation électronique, enchères en ligne, agents logiciels, stratégie de négociation, coordination, système à base de règles, moteur de règles

Coordination of Mobile Mules via Facility Location Strategies

In this paper, we study the problem of wireless sensor network (WSN) maintenance using mobile entities called mules. The mules are deployed in the area of the WSN in such a way that would minimize the time it takes them to reach a failed sensor and fix it. The mules must constantly optimize their collective deployment to account for occupied mules. The objective is to define the optimal deployment and task allocation strategy for the mules, so that the sensors' downtime and the mules' traveling distance are minimized. Our solutions are inspired by research in the field of computational geometry and the design of our algorithms is based on state of the art approximation algorithms for the classical problem of facility location. Our empirical results demonstrate how cooperation enhances the team's performance, and indicate that a combination of k-Median based deployment with closest-available task allocation provides the best results in terms of minimizing the sensors' downtime but is inefficient in terms of the mules' travel distance. A k-Centroid based deployment produces good results in both criteria.Comment: 12 pages, 6 figures, conferenc

Decentralized dynamic task allocation for UAVs with limited communication range

We present the Limited-range Online Routing Problem (LORP), which involves a team of Unmanned Aerial Vehicles (UAVs) with limited communication range that must autonomously coordinate to service task requests. We first show a general approach to cast this dynamic problem as a sequence of decentralized task allocation problems. Then we present two solutions both based on modeling the allocation task as a Markov Random Field to subsequently assess decisions by means of the decentralized Max-Sum algorithm. Our first solution assumes independence between requests, whereas our second solution also considers the UAVs' workloads. A thorough empirical evaluation shows that our workload-based solution consistently outperforms current state-of-the-art methods in a wide range of scenarios, lowering the average service time up to 16%. In the best-case scenario there is no gap between our decentralized solution and centralized techniques. In the worst-case scenario we manage to reduce by 25% the gap between current decentralized and centralized techniques. Thus, our solution becomes the method of choice for our problem

An Investigation Report on Auction Mechanism Design

Auctions are markets with strict regulations governing the information available to traders in the market and the possible actions they can take. Since well designed auctions achieve desirable economic outcomes, they have been widely used in solving real-world optimization problems, and in structuring stock or futures exchanges. Auctions also provide a very valuable testing-ground for economic theory, and they play an important role in computer-based control systems. Auction mechanism design aims to manipulate the rules of an auction in order to achieve specific goals. Economists traditionally use mathematical methods, mainly game theory, to analyze auctions and design new auction forms. However, due to the high complexity of auctions, the mathematical models are typically simplified to obtain results, and this makes it difficult to apply results derived from such models to market environments in the real world. As a result, researchers are turning to empirical approaches. This report aims to survey the theoretical and empirical approaches to designing auction mechanisms and trading strategies with more weights on empirical ones, and build the foundation for further research in the field

Efficiency Advantages of Grandfathering in Rights-Based Fisheries Management

We show that grandfathering fishing rights to local users or recognizing first possessions is more dynamically efficient than auctions of such rights. It is often argued that auctions allocate rights to the highest-valued users and thereby maximize resource rents. We counter that rents are not fixed in situ, but rather depend additionally upon the innovation, investment, and collective actions of fishers, who discover and enhance stocks and convert them into valuable goods and services. Our analysis shows how grandfathering increases rents by raising expected rates of return for investment, lowering the cost of capital, and providing incentives for collective action.Fishing rights, property rights, allocating fishing rights, grandfathering fishing rights, auctions of fishing rights, fisheries rent

Bidder Collusion

Within the heterogeneous independent private values model, we analyze bidder collusion at first and second price single-object auctions, allowing for within-cartel transfers. Our primary focus is on (i) coalitions that contain a strict subset of all bidders and (ii) collusive mechanisms that do not rely on information from the auctioneer, such as the identity of the winner or the amount paid. To analyze collusion, a richer environment is required than that required to analyze non-cooperative behavior. We must account for the possibility of shill bidders as well as mechanism payment rules that may depend on the reports of cartel members or their bids at the auction. We show there are cases in which a coalition at a first price auction can produce no gain for the coalition members beyond what is attainable from non-cooperative play. In contrast, a coalition at a second price auction captures the entire collusive gain. For collusion to be effective at a first price auction we show that the coalition must submit two bids that are different but close to one another, a finding that has important empirical implicationsauctions, collusion, bidding rings, shill

Microeconomic Policies in the New Economy

Competition policy, Technology policy, Network industries

E-COMMERCE: A NEW BUSINESS MODEL FOR THE FOOD SUPPLY/DEMAND CHAIN

The use of electronic commerce for quality control and cost cutting efficiencies by the food and agricultural industries in the United States is the focus of this paper. The food industry engages in e-commerce through 1.) Internet shopping for consumers called business-to-consumer (B2C) e-commerce 2.) Business-to-business (B2B) Internet market discovery exchanges used by food suppliers at any point in the supply chain, and 3.) Business-to-business (B2B) relationships that reduce costs and increase efficiencies in the procurement, storage and delivery of food to retail stores or distribution centers. This third use of e-commerce is the most highly developed and widely adopted. It allows retailers to share information about consumers' purchases and preferences with food manufacturers and farmers and for tracking food products' characteristics, source, and movement from production to consumer. This circle of information allows high quality and consistent products to be consumed at lower prices. This paper is about the development of e-commerce in the food industry, the economic concepts and goals that it meets, and the changes it brings to the industry. E-commerce both fosters and demands vertical coordination. It favors consolidation of firms. It changes the business culture from one of adversarial relationships to one of cooperation and trust. It changes the historical supply chain into a supply/demand loop while it lowers the cost of food. Policy issues arise around monopoly power, privacy, a diminution of variety, and the demise of small, undercapitalized firms.Industrial Organization, Marketing,

Side-Payments and the Costs of Conflict.

Conflict and competition often impose costs on both winners and losers, and conflicting parties may prefer to resolve the dispute before it occurs. The equilibrium of a conflict game with side-payments predicts that with binding offers, proposers make and responders accept side-payments, generating settlements that strongly favor proposers. When side-payments are non-binding, proposers offer nothing and conflicts always arise. Laboratory experiments confirm that binding side-payments reduce conflicts. However, 30% of responders reject binding offers, and offers are more egalitarian than predicted. Surprisingly, non-binding side-payments also improve efficiency, although less than binding. With binding side-payments, 87% of efficiency gains come from avoided conflicts. However, with non-binding side-payments, only 39% of gains come from avoided conflicts and 61% from reduced conflict expenditures.contests, conflict resolution, side-payments, experiments

Competitive Auctions: Theory and Application

The theory of competitive auctions offers a coherent framework for modelling coordination frictions as a non-cooperative game. The theory represents an advancement over cooperative approaches that make exogenous assumptions about how output is divided between buyers and sellers and about the forces that bring buyers and sellers into local markets. Moreover, unlike price posting models, which fix the terms of trade prior to matching, competitive auction models have a bidding process that allocates the good (or service) to the highest valuation bidder at a price equal to the second highest valuation. Therefore, the competing auction model is more robust to problems in which there are heterogenous valuations. This paper develops the theory of competitive auctions and applies it to a number of practical problems in microeconomics, labor economics, industrial organization, investment theory and monetary economics.