Abstract. Experimentalists frequently claim that human subjects in the laboratory violate game-theoretic predictions. It is here argued that this claim is usually premature. The paper elaborates on this theme by way of raising some conceptual and methodological issues in connection with the very definition of a game and of players ’ preferences, in particular with respect to potential context dependence, interpersonal preference dependence, backward induction and incomplete information.

In this paper we present three scheduling mechanisms that are manipulation-proof for closed systems. The amount of information that each user must encode in the mechanism increases with the complexity of the mechanism. On the other hand, the more complex the mechanism is, the more it maintains the privacy of the users. The first mechanism is a centralized, calendar-oriented one. It is the least computationally complex of the three, but does not maintain user privacy. The second is a distributed meeting-oriented mechanism that maintains user privacy, but at the cost of greater computational complexity. The third mechanism, while being the most complex, maintains user privacy (for the most part) and allows users to have the greatest influence on the resulting schedule. 1 Introduction The basic research problem in meeting scheduling is that of timing, that is, when to set a meeting. This question becomes more complicated when there are several meetings to be scheduled that involve the sa...

This paper lays part of the groundwork for a domain theory of negotiation, that is, a way of classifying interactions so that it is clear, given a domain, which negotiation mechanisms and strategies are appropriate. We define State Oriented Domains, a general category of interaction. Necessary and sufficient conditions for cooperation are outlined. We use the notion of worth in an altered definition of utility, thus enabling agreements in a wider class of joint-goal reachable situations. An approach is offered for conflict resolution, and it is shown that even in a conflict situation, partial cooperative steps can be taken by interacting agents (that is, agents in fundamental conflict might still agree to cooperate up to a certain point). A Unified Negotiation Protocol (UNP) is developed that can be used in all types of encounters. It is shown that in certain borderline cooperative situations, a partial cooperative agreement (i.e., one that does not achieve all agents' goals) might be ...

We show how a system of artificial adaptive agents, using a genetic algorithm based learning technique, can learn strategies that enable it to effectively participate in stylized business negotiations. The negotiation policies learned are evaluated on several dimensions, including joint outcomes, nearness to the efficient frontier, and the similarity to outcomes of human negotiations. The results are promising for integrating such agents into practicable electronic commerce systems. We discuss what a system might look like and ways in which particular classes of business negotiations could be supported or even entirely automated. 1 Introduction Even in simple negotiations, people often reach sub-optimal negotiations thereby "leaving money on the table" [1] [2]. While many factors contribute to missing out on gains from trade---overconfidence, falsely assuming fixed pies, and the framing of the situation (e.g. [3])---the end result is that parties fail to find agreements which would ma...

the rules by which agents in an encounter will interact. Once the rules of encounter have been determined, each builder of each agent is free to design his own machine any way that he wants. However, the rules that were established will certainly affect the choices he makes in building his own agent.

Ben Grocholsky Doctor of Philosophy The University of Sydney March 2002 Information-Theoretic Control of This thesis is concerned with the development of a consistent, information-theoretic basis for understanding of coordination and cooperation decentralised multi-sensor multi-platform systems. Autonomous systems composed of multiple sensors and multiple platforms potentially have significant importance in applications such as defence, search and rescue, mining or intelligent manufacturing. However, the e#ective use of multiple autonomous systems requires that an understanding be developed of the mechanisms of coordination and cooperation between component systems in pursuit of a common goal. A fundamental, quantitative, understanding of coordination and cooperation between decentralised autonomous systems is the main goal of this thesis.

Highlighting the problems posed by a "unitary" conceptualization of the household, a number of economists have in recent years proposed alternative models. These models, especially those embodying the bargaining approach, provide a useful framework for analyzing gender relations and throw some light on how gender asymmetries are constructed and contested. At the same time, the models have paid inadequate or no attention to some critical aspects of intrahousehold gender dynamics, such as: what factors (especially qualitative ones) affect bargaining power? What is the role of social norms and social perceptions in the bargaining process and how might these factors themselves be bargained over? Are women less motivated than men by self-interest and might this affect bargaining outcomes? Most discussions on bargaining also say little about gender relations beyond the household, and about the links between extrahousehold and intrahousehold bargaining power. This paper spells out the nature ...

We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents ’ types and actions, conditional on linear comparisons of agents ’ actions. We show that this class includes many well-known games including a variety of auctions and a novel allocation game. In some cases, the best-response algorithm can be iterated to compute Bayes-Nash equilibria. We demonstrate the efficacy of our approach on existing and new games. 1

The area of automated negotiation has been of particular interest in AI due to the important role negotiations play in facilitating understanding and the achievement of cooperation among entities with differing interests, whether they be individuals, organizations, governments, or automated agents. This paper presents a strategic model for negotiation of alternative offers, with specific application to international crises. In this model, both players can opt out, and while one loses over time, the other gains (up to a point). Specific issues are: conflicting objectives and utility functions of parties and the impact of time on bargaining behavior in crisis. The general model has relevance to the hostage crisis from which it was built, and subsequent applicability in building an automated negotiation agent for experimental and training purposes. This material is based upon work supported in part by the National Science Foundation under Grant No. IRI-9123460. Part of this work was co...

Abstract. This paper presents some of the key techniques for reaching agreements in multi-agent environments. It discusses game-theory and economics based techniques: strategic negotiation, auctions, coalition formation, market-oriented programming and contracting. It also presents logical based mechanisms for argumentations. The focus of the survey is on negotiation of self-interested agents, but several mechanisms for cooperative agents who need to resolve conflicts that arise from conflicting beliefs about different aspects of their environment are also mentioned. For space reasons, we couldn’t cover all the relevant works, and the papers that are mentioned only demonstrate the possible approaches. We present some of the properties of the approaches using our own previous work. 1