ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Artificial Intelligence
Volume 87, Issues 1-2, November 1996, Pages 21-74
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
PDF (4252 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0004-3702(95)00105-0    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1996 Published by Elsevier Science B.V.

Deriving consensus in multiagent systems

Eithan EphratiE-mail The Corresponding Author, a and Jeffrey S. Rosenscheinb, Corresponding Author Contact Information, E-mail The Corresponding Author

a AgentSoft Ltd., P.O. Box 53047, Jerusalem, Israel b Institute of Computer Science, The Hebrew University, Jerusalem, Israel

Available online 16 February 1999.

Abstract

Consider the designers of a multiagent environment, who are charged with establishing 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.

In this article we suggest an economic decision process that can be used to derive multiagent consensus, namely, the Clarke tax mechanism (E.H. Clarke, 1971). Consensus is reached through the process of voting; each agent expresses its preferences, and a group choice mechanism is used to select the result. Clarke tax-like mechanisms provide a set of attractive alternatives for the designers of multiagent environments, particularly if those environments consist of individually motivated heterogeneous agents.

The Clarke tax mechanism has many desirable properties such as non-manipulability, individual rationality, and maximization of the agents' global utility. However, though theoretically attractive, the Clarke tax presents a number of difficulties when one attempts to use it in practical implementations. This article examines how the Clarke tax could be used as an effective consensus mechanism in domains consisting of automated agents. In particular, we consider how agents can come to a consensus without needing to reveal full information about their preferences, and without needing to generate alternatives prior to the voting process.

References

[1]. A.R. Adami and M. Perry, Joint project without commitment. Rev. Econ. Stud. 58 (1991), pp. 259–276.

[2]. K.J. Arrow. In: Social Choice and Individual Values, Wiley, New York (1963).

[3]. E. Bennet and D. Conn, The group incentive properties of mechanisms for the provision of public goods. Public Choice 24 (1977), pp. 95–102.

[4]. K. Binmore. In: Fun and Games, A Text on Game Theory, Heath, Lexington, MA (1992).

[5]. D. Chapman, Planning for conjunctive goals. Artif. Intell. 32 (1987), pp. 333–377. Abstract | PDF (2530 K) | View Record in Scopus | Cited By in Scopus (138)

[6]. E.H. Clarke, Multipart pricing of public goods. Public Choice 11 (1971), pp. 17–33. View Record in Scopus | Cited By in Scopus (335)

[7]. E.H. Clarke, Multipart pricing of public goods: an example. In: S. Muskin, Editor, Public Prices for Public Products, Urban Institute, Washington, DC (1972).

[8]. S.E. Conry, R.A. Meyer and V.R. Lesser, Multistage negotiation in distributed planning. In: A.H. Bond and L. Gasser, Editors, Readings in Distributed Artificial Intelligence, Morgan Kaufmann, San Mateo, CA (1988), pp. 367–384.

[9]. D. Corkill, Hierarchical planning in a distributed environment. In: Proceedings IJCAI-79 (1979), pp. 168–175.

[10]. D.D. Corkill, A framework for organizational self-design in distributed problem solving networks. In: PhD thesis, University of Massachusetts, Amherst, MA (1982).

[11]. J. Doyle, Rationality and its role in reasoning. Comput. Intell. 8 (1992), pp. 376–409.

[12]. J. Doyle and M.P. Wellman, Impediments to universal preference-based default theories. Artif. Intell. 49 (1992), pp. 97–128.

[13]. E.H. Durfee. In: Coordination of Distributed Problem Solvers, Kluwer Academic Publishers, Boston, MA (1988).

[14]. E.H. Durfee and V.R. Lesser, Negotiating task decomposition and allocation using partial global planning. In: L. Gasser and M.N. Huhns, Editors, Distributed Artificial Intelligence Vol. II, Morgan Kaufmann, San Mateo, CA (1989), pp. 229–243.

[15]. E.H. Durfee and J.S. Rosenschein, Distributed problem solving and multi-agent systems: comparisons and examples. In: Proceedings Thirteenth International Workshop on Distributed Artificial Intelligence (1994), pp. 94–104.

[16]. J. Elgot-Drapkin, M. Miller and D. Perlis, The two frame problems. In: Proceedings 1987 Workshop on the Frame Problem in Artificial Intelligence (1987), pp. 23–28.

[17]. E. Ephrati, Planning and consensus among autonomous agents. In: PhD thesis, The Hebrew University of Jerusalem, Jerusalem (1993).

[18]. E. Ephrati and J.S. Rosenschein, The Clarke Tax as a consensus mechanism among automated agents. In: Proceedings AAAI-91 (1991), pp. 173–178.

[19]. E. Ephrati and J.S. Rosenschein, Multi-agent planning as search for a consensus that maximizes social welfare. In: Pre-Proceedings Fourth European Workshop on Modeling Autonomous Agents in a Multi-Agent World (1992) Chapter 3 .

[20]. E. Ephrati and J.S. Rosenschein, Reaching agreement through partial revelation of preferences. In: Proceedings Tenth European Conference on Artificial Intelligence (1992), pp. 229–233.

[21]. E. Ephrati and J.S. Rosenschein, Distributed consensus mechanisms for self-interested heterogeneous agents. In: Proceedings First International Conference on Intelligent and Cooperative Information SystemsRotterdam, , IEEE Computer Society Press, Silver Spring, MD (1993), pp. 71–79.

[22]. E. Ephrati and J.S. Rosenschein, Multi-agent planning as a dynamic search for social consensus. In: Proceedings IJCAI-93 (1993), pp. 423–429.

[23]. E. Ephrati, G. Zlotkin and J.S. Rosenschein, Meet your destiny: a non-manipulable scheduler. In: Proceedings ACM 1994 Conference on Computer Supported Cooperative Work (1994), pp. 359–371.

[24]. O. Etzioni, Embedding decision-analytic control in a learning architecture. Artif. Intell. 49 (1991), pp. 129–159. Abstract | PDF (1662 K) | View Record in Scopus | Cited By in Scopus (14)

[25]. J.A. Feldman and R.F. Sproull, Decision theory and Artificial Intelligence II: the hungry monkey. Cognit. Sci. 1 (1977), pp. 158–192. Abstract | View Record in Scopus | Cited By in Scopus (16)

[26]. P.C. Fishburn, Condorcet social choice functions. SIAM J. Appl. Math. 33 (1977), pp. 469–489.

[27]. D. Fudenberg and J. Tirole. In: Game Theory, The MIT Press, Cambridge, MA (1992).

[28]. M.R. Genesereth and R.E. Fikes, Knowledge interchange format version 3 reference manual. In: Tech. Note Logic-92-1, Stanford University Logic Group, Stanford, CA (1992).

[29]. M. Georgeff, Communication and interaction in multi-agent planning. In: Proceedings AAAI-83 (1983), pp. 125–129. View Record in Scopus | Cited By in Scopus (40)

[30]. M. Georgeff, A theory of action for multi-agent planning. In: Proceedings AAAI-84 (1984), pp. 121–125.

[31]. A. Gibbard, Manipulation of voting schemes: a general result. Econometrica 41 (1973), pp. 587–602.

[32]. M.L. Ginsberg and D.E. Smith, Reasoning about action I: a possible worlds approach. In: Proceedings 1987 Workshop on the Frame Problem in Artificial Intelligence (1987), pp. 233–258.

[33]. M.L. Ginsberg and D.E. Smith, Reasoning about action II: the qualification problem. In: Proceedings 1987 Workshop on the Frame Problem in Artificial Intelligence (1987), p. 259.

[34]. P.J. Gmytrasiewicz, E.H. Durfee and D.K. Wehe, A decision-theoretic approach to coordinating multiagent interactions. In: Proceedings IJCAI-91 (1991), pp. 62–68.

[35]. I.J. Good, Justice in voting by demand revelation. Public Choice 29 (1977), pp. 65–70. View Record in Scopus | Cited By in Scopus (2)

[36]. J. Green, E. Kohlberg and J.J. Laffont, Partial equilibrium approach to the free rider problem. J. Public Econ. 6 (1976), pp. 375–394. Abstract | PDF (1067 K) | View Record in Scopus | Cited By in Scopus (20)

[37]. J. Green and J.J. Laffont, Coalition incentive compatibility. Rev. Econ. Stud. 46 (1979), pp. 243–254.

[38]. B.J. Grosz and S. Kraus, Collaborative plans for group activities. In: Proceedings IJCAI-93 (1993), pp. 367–373.

[39]. B.J. Grosz and C. Sidner, Plans for discourse. In: P.R. Cohen, J. Morgan and M.E. Pollack, Editors, Intentions in Communication, MIT Press, Cambridge, MA (1990).

[40]. T. Groves, Incentives in teams. Econometrica 41 (1973), pp. 617–631.

[41]. T. Groves, On theories of incentive compatible choice with compensation. In: W. Hildenbrand, Editor, Advances in Economic Theory, Cambridge University Press, Cambridge (1980), pp. 1–29.

[42]. P. Haddawy and S. Hanks, Issues in decision-theoretic planning: symbolic goals and numeric utilities. In: Proceedings 1990 DARPA Workshop on Innovative Approaches to Planning, Scheduling, and Control (1990), pp. 48–58.

[43]. J.C. Harsanyi, Approaches to the bargaining problem before and after the theory of games: a critical discussion of Zeuthen's, Hick's and Nash theories. Econometrica 24 (1956), pp. 144–157.

[44]. J.C. Harsanyi, Utilitarian morality in a world of very half-hearted altruists. In: W.P. Heller, R.M. Starr and D.A. Starrett, Editors, Social Choice and Public Decision Making, Cambridge University Press, Cambridge (1986), pp. 57–73 Chapters 3 .

[45]. L. Hurwics, On informationally decentralized systems. In: R. Rander and C.B. McQuire, Editors, Decision an Organization, North-Holland, Amsterdam (1972).

[46]. W. Jacobs and M. Kiefer, Robot decisions based on maximizing utility. In: Proceedings IJCAI-73 (1973), pp. 402–411.

[47]. K. Kanazawa and T. Dean, A model for projection and action. In: Proceedings IJCAI-89 (1989), pp. 985–990.

[48]. M.J. Katz and J.S. Rosenschein, Verifying plans for multiple agents. J. Experim. Theoret. Artif. Intell. 5 (1993), pp. 39–56.

[49]. A.P. Kosoresow, A fast first-cut protocol for agent coordination. In: Proceedings AAA1-93 (1993), pp. 237–242. View Record in Scopus | Cited By in Scopus (0)

[50]. S. Kraus, Agents contracting tasks in non-collaborative environments. In: Proceedings AAAI-93 (1993), pp. 243–248. View Record in Scopus | Cited By in Scopus (8)

[51]. S. Kraus, E. Ephrati and D. Lehmann, Negotiation in a non-cooperative environment. J. Experim. Theoret. Artif. Intell. 3 (1991), pp. 255–282.

[52]. S. Kraus, J. Wilkenfeld and G. Zlotkin, Multiagent negotiation under time constraints. In: Computer Science Technical Report Series CS-TR-2975, University of Maryland, College Park, MD (1992).

[53]. S. Kraus, J. Wilkenfeld and G. Zlotkin, Multiagent negotiation under time constraints. Artif. Intell. 75 (1995), pp. 297–345. Article | PDF (3955 K) | View Record in Scopus | Cited By in Scopus (112)

[54]. J.J. Laffont and E. Maskin, The theory of incentives: an overview. In: H. Werner, Editor, Advances in Economic Theory, Cambridge University Press, Cambridge (1980), pp. 31–94 Chapter 3 .

[55]. R.D. Luce and H. Raiffa. In: Games and Decisions, Wiley, New York (1957).

[56]. T.W. Malone, R.E. Fikes and M.T. Howard, Enterprise: a market-like task scheduler for distributed computing environments. In: B.A. Huberman, Editor, The Ecology of Computation, North-Holland, Amsterdam (1988), pp. 177–205.

[57]. D. McAllester and D. Rosenblitt, Systematic nonlinear planning. In: Proceedings AAAI-91 (1991), pp. 634–639.

[58]. D. McDermott, Planning and acting. Cognit. Sci. 2 (1978), pp. 71–109. Abstract | View Record in Scopus | Cited By in Scopus (12)

[59]. M.S. Miller and K.E. Drexler, Markets and computation: agoric open systems. In: B.A. Huberman, Editor, The Ecology of Computation, North-Holland, Amsterdam (1988), pp. 133–176.

[60]. T. Moehlman and V. Lesser, Cooperative planning and decentralized negotiation in Multi-Fireboss Phoenix. In: Proceedings Workshop on Innovative Approaches to Planning, Scheduling and Control (1990), pp. 144–159.

[61]. Y. Moses and M. Tennenholtz, On cooperation in a multi-entity model. In: Proceedings IJCAI-89 (1989), pp. 918–923.

[62]. Y. Moses and M. Tennenholtz, On computational aspects of artificial social systems. In: Proceedings 11th International Workshop on Distributed Artificial Intelligence (1992), pp. 267–283.

[63]. H. Moulin, Characterization of the pivotal mechanism. J. Public Econ. 31 (1986), pp. 53–78. Abstract | PDF (1295 K) | View Record in Scopus | Cited By in Scopus (10)

[64]. T. Muench and M. Walker, Identifying the free rider problem. In: J.J. Laffont, Editor, Aggregation and Revelation of Preferences, North-Holland, Amsterdam (1979), pp. 61–87 Chapter I(4) .

[65]. J.F. Nash, The bargaining problem. Econometrica 28 (1950), pp. 155–162.

[66]. J.F. Nash, Two-person cooperative games. Econometrica 21 (1953), pp. 128–140.

[67]. R.N. Pelavin, A formal approach to planning with concurrent actions and external events. In: Tech. Rept. TR 254, University of Rochester, Rochester (1988).

[68]. B. Peleg. In: Game Theoretic Analysis of Voting in Committees, Cambridge University Press, Cambridge (1984).

[69]. J.S. Rosenschein, Synchronization of multi-agent plans. In: Proceedings National Conference on Artificial Intelligence (1982), pp. 115–119. View Record in Scopus | Cited By in Scopus (13)

[70]. J.S. Rosenschein and M.R. Genesereth, Deals among rational agents. In: Proceedings IJCAI-85 (1985), pp. 91–99.

[71]. J.S. Rosenschein and G. Zlotkin. In: Rules of Encounter: Designing Conventions for Automated Negotiation among Computers, MIT Press, Cambridge, MA (1994).

[72]. J.S. Rosenschein and G. Zlotkin, Consenting agents: designing conventions for automated negotiation. AI Magazine 15 3 (1994).

[73]. A.E. Roth. In: Axiomatic Models of Bargaining, Springer, Berlin (1979).

[74]. A. Rubinstein, Perfect equilibrium in a bargaining model. Econometrica 50 (1982), pp. 97–109.

[75]. T. Sandholm, An implementation of the contract net protocol based on marginal calculations. In: Proceedings AAAI-93 (1993), pp. 256–262. View Record in Scopus | Cited By in Scopus (66)

[76]. N.A. Satterthwaite, Strategy-proofness and Arrow's conditions: existence and social welfare functions. J. Econ. Theory 10 (1975), pp. 187–217.

[77]. L.I. Savage. In: The Foundations of Statistics, Wiley, New York (1964).

[78]. Y. Shoham and M. Tennenholtz, On the synthesis of usful social laws for artificial agent societies. In: Proceedings AAAI-92 (1992), pp. 276–281. View Record in Scopus | Cited By in Scopus (37)

[79]. Y. Shoham and M. Tennenholtz, Emergent conventions in multi-agent systems: initial experimental results and observations (preliminary report). In: Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (1992).

[80]. D. Smith and M. Broadwell, Plan coordination in support of expert systems integration. In: Proceedings DARPA Knowledge-Based Planning Workshop (1987), pp. 12.1–12.6.

[81]. J.S. Smith, Aggregation of preferences with variable electorate. Econometrica 41 (1973), pp. 1027–1041.

[82]. R.G. Smith, A framework for problem solving in a distributed processing environment. In: PhD thesis, Stanford University, Stanford, CA (1978).

[83]. R.G. Smith, The contract net protocol: high-level communication and control in a distributed problem solver. IEEE Trans. Comput. 29 (1980), pp. 1104–1113. View Record in Scopus | Cited By in Scopus (763)

[84]. P.D. Straffin, Jr, Topics in the Theory of Voting. In: The UMAP Expository Monograph Series, Birkhäuser, Boston (1980).

[85]. G.J. Sussman. In: A Computational Model of Skill Acquisition, Elsevier, New York (1975).

[86]. K.P. Sycara, Resolving goal conflicts via negotiation. In: Proceedings AAAI-88 (1988), pp. 245–250.

[87]. K.P. Sycara, Argumentation: planning other agents' plans. In: Proceedings IJCAI-89 (1989), pp. 517–523.

[88]. T.N. Tideman and G. Tullock, A new and superior process for making social choice. J. Polit. Econ. 84 (1976), pp. 1145–1159.

[89]. G. Tullock, The demand-revealing process as a welfare indicator. Public Choice 29 (1977), pp. 51–63. View Record in Scopus | Cited By in Scopus (1)

[90]. W. Vickrey, Counterspeculation, auctions and competitive sealed tenders. J. Finance 16 (1961), pp. 8–37.

[91]. M.R Wellman, A market-oriented programming environment and its application to distributed multicommodity flow problems. J. Artif. Intell. Res. 1 (1993), pp. 1–23.

[92]. F. Zeuthen. In: Problems of Monopoly and Economic Walfare, Routledge & Sons, London (1930).

[93]. G. Zlotkin and J.S. Rosenschein, Negotiation and conflict resolution in non-cooperative domains. In: Proceedings AAAI-90 (1990), pp. 100–105.

[94]. G. Zlotkin and J.S. Rosenschein, Negotiation and goal relaxation. In: Proceedings of the Second European Workshop on Modeling Autonomous Agents in a Multi-Agent WorldY. Demazeau and J.P. Muller, Editors, Decentralized A.I. 2, Elsevier Science Publishers, Amsterdam (1991), pp. 273–286.

Corresponding Author Contact InformationCorresponding author.


Artificial Intelligence
Volume 87, Issues 1-2, November 1996, Pages 21-74
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.