Abstract
In cooperative problem solving, while some communication is necessary, privacy issues can limit the amount of information transmitted. We study this problem in the context of meeting scheduling. Agents propose meetings consistent with their schedules while responding to other proposals by accepting or rejecting them. The information in their responses is either a simple accept/reject or an account of meetings in conflict with the proposal. The major mechanism of inference involves an extension of CSP technology, which uses information about possible values in an unknown CSP. Agents store such information within ‘views’ of other agents. We show that this kind of possibilistic information in combination with arc consistency processing can speed up search under conditions of limited communication. This entails an important privacy/efficiency tradeoff, in that this form of reasoning requires a modicum of actual private information to be maximally effective. If links between derived possibilistic information and events that gave rise to these deductions are maintained, actual (meeting) information can be deduced without any meetings being communicated. Such information can also be used heuristically to find solutions before such discoveries can occur.
This work was supported in part by NSF Grant No. IIS-9907385 and Nokia, Inc and by Science Foundation Ireland Grant No. 00/PI.1/C075.
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
Yokoo, M.: Distributed Constraint Satisfaction. Foundations of Cooperation in Multi-Agent Systems. Springer, Berlin (1998)
Luo, X., Leung, H., Lee, J.H.: Theory and properties of a selfish agent protocol for multi-agent meeting scheduling using fuzzy constraints. In: Proc., 14th European Conference on Artificial Intelligence, ECAI 2000, pp. 373–377. IOS, Amsterdam (2000)
Sen, S.: Developing an automated distributed meeting scheduler. IEEE Expert 12, 41–45 (1997)
Garrido, L., Sycara, K.: Multi-agent meeting scheduling: Preliminary experimental results. In: Proc., Second International Conference on Multi-Agent Systems, ICMAS 1996, AAAI Press, Menlo Park (1996)
Woolridge, M.: An Introduction to Multi Agent Systems. John Wiley & Sons, Chichester (2002)
Wallace, R.J.: Representing possibilities in relation to constraints and agents. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 407–418. Springer, Heidelberg (2002)
Hughes, G.E., Cresswell, M.J.: An Introduction to Modal Logic. Routledge, London (1968)
Rao, A.S., Georgeff, M.P.: Modeling rational agents with a bdi-architecture. In: Proc. Second International Conference on Principles of Knowledge Representation and Reasoning, KR 1991, San Mateo, CA, pp. 473–484. Morgan Kaufmann, San Francisco (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wallace, R.J., Freuder, E.C., Minca, M. (2004). Possibilistic Reasoning and Privacy/Efficiency Tradeoffs in Multi-agent Systems. In: Monroy, R., Arroyo-Figueroa, G., Sucar, L.E., Sossa, H. (eds) MICAI 2004: Advances in Artificial Intelligence. MICAI 2004. Lecture Notes in Computer Science(), vol 2972. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24694-7_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-24694-7_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21459-5
Online ISBN: 978-3-540-24694-7
eBook Packages: Springer Book Archive