There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of preference judgments, i.e., statements to the effect that one instance should be ranked ahead of another. We outline a two-stage approach in which one first learns by conventional means a preference function, of the form PREF(u; v), which indicates whether it is advisable to rank u before v. New instances are then ordered so as to maximize agreements with the learned preference function. We show that the problem of finding the ordering that agrees best with a preference function is NP-complete, even under very restrictive assumptions. Nevertheless, we describe a simple greedy algorithm that is guaranteed to find a good approximation. We then discuss an on-line learning algorithm, based on the "Hedge" algorithm, for finding a good linear combination of ranking "experts." We use the ordering algorith...

This technical definition will only make sense toe reader by Ch. 4, once goals and management processes have been described. All that matters forrs section is that a difference between goals and perturbance be noted by the reader. Astate perturbance is not a goal, but it arises out of the processing of goals. In Ch. 7, arelation00 perturbance and "emotion" is discussed. 43 . Sloman says of certain moods that they are "persistent states with dispositional power to color and modify a host of other states and processes. Such moodscan39061-6 be caused by cognitive events with semantic content, though they need not be.[...]0-64000 their control function does not require specific semantic content, though theycan0371-62 cognitive processes that do involve semantic content." (Sloman, 1992b Section 6).A 39642 view is taken in (Oatley, 1992). To be more precise, moods are temporary control stateswhich9881-5 the prominence of some motivators while decreasing others. In particular, they affectthe 41330-5 that certain "goal generators" are triggered. Moreover, moods affect the valenceofce 39476 evaluations, and the likelihood of affective evaluations (perhaps by modifying thresholdsofsholds 42 that trigger evaluations). It is not yet clear whether moods as defined here are9531 - or whether they merely emerge as side-effects of functional processes. . A reflex is a ballistic form of behaviour that can be specified by a narrow setw rules based on input integration and a narrow amount of internal state. There aretwo0981 of reflexes: simple reflexes and fixed action patterns. A simple reflex involves oneaction,-43000 a fixed action pattern involves a collection of actions. Usually, at most only asmall-4120 of perceptual feedback influences reflex action. This would require a definit...

Emerging Web services standards enable the development of large-scale applications in open environments. In particular, they enable services to be dynamically bound. However, current techniques fail to address the critical problem of selecting the right service instances. Service selection should be determined based on user preferences and business policies, and consider the trustworthiness of service instances. We propose a multiagent approach that naturally provides a solution to the selection problem. This approach is based on an architecture and programming model in which agents represent applications and services. The agents support considerations of semantics and quality of service (QoS). They interact and share information, in essence creating an ecosystem of collaborative service providers and consumers. Consequently, our approach enables applications to be dynamically configured at runtime in a manner that continually adapts to the preferences of the participants. Our agents are designed using decision theory and use ontologies. We evaluate our approach through simulation experiments.

This paper presents the preference ratios in multiattribute evaluation (PRIME) method which supports the analysis of incomplete information in multiattribute weighting models. In PRIME, preference elicitation and synthesis is based on 1) the conversion of possibly imprecise ratio judgments into an imprecisely specified preference model, 2) the use of dominance structures and decision rules in deriving decision recommendations, and 3) the sequencing of the elicitation process into a series of elicitation tasks. This process may be continued until the most preferred alternative is identified or, alternatively, stopped with a decision recommendation if the decision maker is prepared to accept the possibility that the value of some other alternative is higher. An extensive simulation study on the computational properties of PRIME is presented. The method is illustrated with a re-analysis of an earlier case study on international oil tanker negotiations.

Global communication networks and advances in information technology enable the design of information systems facilitating effective formulation and efficient resolution of negotiation problems. Increasingly, these systems guide negotiators in clarifying the relevant issues, provide media for offer formulation and exchange, and help in achieving an agreement. In practice, the task of analysing, modelling, designing and implementing electronic negotiation media demands a systematic, traceable and reproducible approach. An engineering approach to media specification and construction has these characteristics. In this paper, we provide a rationale for the engineering approach that allows pragmatic adoption of economic and social sciences perspectives on negotiated decisions for the purpose of supporting and undertaking electronic negotiations. Similarities and differences of different theories that underlie on-going studies of electronic negotiations are identified. This provides a basis for integration of different theories and approaches for the specific purpose of the design of effective electronic negotiations. Drawing on diverse streams of literature in different fields such as economics, management, computer, and behavioural sciences, we present an example of an integration of three significant streams of theoretical and applied research involving negotiations, traditional auctions and on-line auctions.

Methods for incorporating imprecision in engineering design decision-making are briefly reviewed and compared. A tutorial is presented on the Method of Imprecision (MoI), a formal method, based on the mathematics of fuzzy sets, for representing and manipulating imprecision in engineering design. The results of a design cost estimation example, utilizing a new informal cost specification, are presented. The MoI can provide formal information upon which to base decisions during preliminary engineering design and can facilitate set-based concurrent design.

Two methods have been proposed for manipulating uncertainty reflecting designer choice: utility theory and the method of imprecision. Both methods represent this uncertainty across decision making attributes with zero to one ranks, higher preference modeled with a higher rank. The two methods can differ, however, in the combination metrics used to combine the ranks of the incommensurate design attributes. Utility theory resolves the multi-attributes using various well proven additive metrics. In contrast, the method of imprecision resolves by also considering non-additive metrics, such as ranking by the worst case performance or by multiplicative metrics. The axioms of utility theory are appropriate for designs where it is deemed the attributes can always be traded off, even to the point of achieving zero preference in some attributes. In the case of a design with attributes which cannot have zero preference, such as stress limits or maximum allowed cost, the method of imprecision is more appropriate: it trades off attribute levels without permitting any of them to be traded off to zero performance. 1

. We propose a bidding mechanism for data allocation in environments of self-motivated data servers with no common preferences and no central controller. The model considers situations where each server is concerned with the data stored locally, but does not have preferences concerning the exact storage location of data stored in remote servers. We considered situations of complete, as well as incomplete, information, and formally proved that our method is stable and yields honest bids. In the case of complete information, we also proved that the results obtained by the bidding approach are always better than the results obtained by the static allocation policy currently used for data allocation for servers in distributed systems. In the case of incomplete information, we demonstrated, using simulations, that the quality of the bidding mechanism is, on average, better than that of the static policy. 1 Introduction In this paper, we consider the problem of determining the location of d...

: This paper presents the Riskit method for software engineering risk management. This document contains the motivation for the method, description of the Riskit analysis graph and a detailed description of the Riskit process. 2 Table of Contents 1.

Although game-tree search works well in perfectinformation games, there are problems in trying to use it for imperfect-information games such as bridge. The lack of knowledge about the opponents ' possible moves gives the game tree a very large branching factor, making the tree so immense that game-tree searching is infeasible. In this paper, we describe our approach for overcoming this problem. We develop a model of imperfect-information games, and describe how to represent information about the game using a modified version of a task network that is extended to represent multi-agency and uncertainty. We present a game-playing procedure that uses this approach to generate game trees in which the set of alternative choices is determined not by the set of possible actions, but by the set of available tactical and strategic schemes. In our tests of this approach on the game of bridge, we found that it generated trees having a much smaller branching factor than would have been generated b...