TY - GEN
T1 - Suggestion strategies for constraint-based Matchmaker agents
AU - Freuder, Eugene C.
AU - Wallace, Richard J.
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.
PY - 1998
Y1 - 1998
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84957714272
U2 - 10.1007/3-540-49481-2_15
DO - 10.1007/3-540-49481-2_15
M3 - Conference proceeding
AN - SCOPUS:84957714272
SN - 3540652248
SN - 9783540652243
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 192
EP - 204
BT - Principles and Practice of Constraint Programming – CP 1998 - 4th International Conference, CP 1998, Proceedings
A2 - Puget, Jean-Francois
A2 - Maher, Michael
PB - Springer Verlag
T2 - 4th International Conference on Principles and Practice of Constraint Programming, CP 1998
Y2 - 26 October 1998 through 30 October 1998
ER -