Compromise matching in P2P e-marketplaces: concept, algorithm and use case

Authors:
Manish Joshi;Virendrakumar C. Bhavsar;Harold Boley
Affiliations:
Department of Computer Science, North Maharashtra University, Jalgaon, India;Faculty of Computer Science, University of New Brunswick, Fredericton, Canada;Institute for Information Technology, National Research Council, Canada
Venue:
MIWAI'11 Proceedings of the 5th international conference on Multi-Disciplinary Trends in Artificial Intelligence
Year:
2011

Citing 7
Cited 1

Integrating information via matchmaking

Journal of Intelligent Information Systems - Special issue on intelligent integration of information
Heterogeneous Agent Systems

Heterogeneous Agent Systems
Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace

Autonomous Agents and Multi-Agent Systems
A System for Principled Matchmaking in an Electronic Marketplace

International Journal of Electronic Commerce
Vague Knowledge Bases for Matchmaking in P2P E-Marketplaces

ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
A knowledge representation model for matchmaking systems in e-marketplaces

Proceedings of the 11th International Conference on Electronic Commerce
Matchmaking in p2p e-marketplaces: soft constraints and compromise matching

Proceedings of the 12th International Conference on Electronic Commerce: Roadmap for the Future of Electronic Business

Automated matchmaking of student skills and academic course requisites

Proceedings of the CUBE International Information Technology Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

A basic component of automated matchmaking is the automatic generation of a ranked list of profiles matching with the profiles of a given participant. Identifying and ranking of matching profiles among thousands of candidate profiles is a challenging task. In order to determine the degree of matching between two profiles, corresponding pairs of constraints are compared and aggregated to the overall similarity between the two profiles. This paper describes the structure and algorithm of a proposed matchmaking system with a focus on the central notion of compromise match. A compromise match is called for when either one or both constraints within a pair are soft and moreover their values do not match exactly. Two important aspects of compromise matching are discussed, namely compromise count factor , compromise count reduction factor ; furthermore their effect on ranking is described. A use case with a sample set of home rental profiles from an existing e-marketplace is employed for demonstration.