Agreement spaces for counselor agents

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Agreement spaces for counselor agents

Full text

Pdf (193 KB)

Source

International Conference on Autonomous Agents archive
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 table of contents

Budapest, Hungary

SESSION: Interactions table of contents

Pages 1205-1206

Year of Publication: 2009

ISBN:978-0-9817381-7-8

Authors

C. Carrascosa	Universidad Politécnica de Valencia, Valencia, Spain
M. Rebollo	Universidad Politécnica de Valencia, Valencia, Spain

Sponsors

: The Foundation for Intelligent Physical Agents
Microsoft Research : Microsoft Research
: Whitestein Technologies
: European Office of Aerospace Research and Development, Air Force Office of Scientific Research, United States Air Force Research Laboratory
: Drexel University
: Wiley -- Blackwell Ltd

Publisher

International Foundation for Autonomous Agents and Multiagent Systems Richland, SC

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 14, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

ABSTRACT

This paper presents a model of agreement context as an euclidean space that can be solved as a Constraint Satisfaction Problem. This will allow to have a mediator (Counselor Agent) that models the agreement as an space, checks the viability of the agreement as it is being built, and even gives some counsels about the agreement terms being formulated.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	T. M. Chan. Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete and Computational Geometry, 16:361--368, 1996.
	2	J. Knottenbelt. Contract Related Agents. PhD thesis, Department of Computing, Imperial College London, December 2006.
	3	Amir Padovitz , Seng Wai Loke , Arkady Zaslavsky, Towards a Theory of Context Spaces, Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops, p.38, March 14-17, 2004
	4	M. A. Salido, A. Giret, and F. Barber. Constraint satisfaction by means of dynamic polyhedra. In Operational Research Proceedings 2001, pages 405--412. Springer Verlag, 2001.