Abstract
In this paper we describe a paradigm for content-focused matchmaking, based on a recently proposed model for constraint acquisition and satisfaction. Matchmaking agents are conceived as constraint-based solvers that interact with other, possibly human, agents (Customers). The Matchmaker provides potential solutions (“suggestions”) based on partial knowledge, while gaining further information about the problem itself from the other agent through the latter’s evaluation of these suggestions. The dialog between Matchmaker and Customer results in iterative improvement of solution quality, as demonstrated in simple simulations. We also show empirically that this paradigm supports “suggestion strategies” for finding acceptable solutions more efficiently or for increasing the amount of information obtained from the Customer. This work also indicates some ways in which the tradeoff between these two metrics for evaluating performance can be handled
This material is based on work supported by the National Science Foundation under Grant No. IRI-9504316.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
E. C. Freuder. Active learning for constraint satisfaction. In Active Learning. AAAI-95 Fall Symposium Series, Working Notes, pp. 34–35, 1995.
P. A. Geelen. Dual viewpoint heuristics for binary constraint satisfaction problems. In Proceedings ECAI-92, pp. 31–35, 1992.
J. Gomez, D. E. Weisman, V. B. Trevino, and C. A. Woolsey. Content-focused matchmakers (excerpt). In Money & Technology Strategies, volume 2(3). Forrester Research, Inc., 1996.
M. Krantz. The web’s middleman. Time, pp. 67–68, February 17, 1997.
M. Okhi, A. Takeuchi, and K. Furukawa. A framework for interactive problem solving based on interactive query revision. In Logic Programmming’ 86, LNCS Vol. 264, pp. 137–146. Springer-Verlag, Berlin, 1987.
P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9:268–299, 1993.
M. H. van Emden, M. Ohki, and A. Takeuchi. Spreadsheets with incremental queries as a user interface for logic programming. New Generation Computing, 4:287–304, 1986.
R. J. Wallace. Analysis of heuristic methods for partial constraint satisfaction problems. In E. C. Freuder, editor, Principles and Practice of Constraint Programming-CP’96, LNCS Vol. 1118, pp. 482–496. Springer, Berlin, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Freuder, E.C., Wallace, R.J. (1998). Suggestion Strategies for Constraint-Based Matchmaker Agents. In: Maher, M., Puget, JF. (eds) Principles and Practice of Constraint Programming — CP98. CP 1998. Lecture Notes in Computer Science, vol 1520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49481-2_15
Download citation
DOI: https://doi.org/10.1007/3-540-49481-2_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65224-3
Online ISBN: 978-3-540-49481-2
eBook Packages: Springer Book Archive