Abstract
This paper proposes a method allowing an agent to perform in a socially fair way by considering other agents’ preferences. Such a balanced action selection process is based on declarative diagnosis, which enables the removal of contradictions arising as all agents’ preferences are confronted within the deciding agent. Agents can be negatively affected when some of their preferences are not respected for the sake of a global compromise. The set of preferences to be yielded by agents in order to remove all contradictions in a balanced way (i.e. the diagnosis that better manages how each agent is to be affected) is determined by minimising a cost function computed over application independent features. By respecting the resulting non-contradictory preferences set, the deciding agent acts cooperatively.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chomicki, J.: Preference formulas in relational queries. ACM Transactions on Database Systems 28, 427–466 (2003)
Andreka, H., Ryan, M., Schobbens, P.Y.: Operators and laws for combining preference relations. Journal of Logic and Computation 12, 13–53 (2002)
Yager, R.R.: Fusion of multi-agent preference ordering. Fuzzy Sets and Systems 117, 1–12 (2001)
Rossi, F., Venable, K.B., Walsh, T.: mCP nets: representing and reasoning with preferences on multiple agents. In: AADEBUG 1993. LNCS, vol. 749, pp. 729–734. AAAI Press, Menlo Park (2004)
Doyle, J.: Prospects for preferences. Computational Intelligence 20, 111–136 (2004)
Dell’Acqua, P., Pereira, L.M.: Preference revision via declarative debugging. In: Bento, C., Cardoso, A., Dias, G. (eds.) EPIA 2005. LNCS, vol. 3808, pp. 18–28. Springer, Heidelberg (2005)
Pereira, L.M., Damásio, C., Alferes, J.J.: Debugging by diagnosing assumptions. In: Fritzson, P.A. (ed.) AADEBUG 1993. LNCS, vol. 749, pp. 58–74. Springer, Heidelberg (1993)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Procs. of the 5th Int. Logic Programming Conf., MIT Press, Cambridge (1998)
Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
Gelder, A.V., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. J. ACM 38, 620–650 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Santana, P., Pereira, L.M. (2006). Emergence of Cooperation Through Mutual Preference Revision. In: Ali, M., Dapoigny, R. (eds) Advances in Applied Artificial Intelligence. IEA/AIE 2006. Lecture Notes in Computer Science(), vol 4031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779568_11
Download citation
DOI: https://doi.org/10.1007/11779568_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35453-6
Online ISBN: 978-3-540-35454-3
eBook Packages: Computer ScienceComputer Science (R0)