Preference-based decision making for cooperative knowledge-based systems
ACM Transactions on Information Systems (TOIS)
Meet your destiny: a non-manipulable meeting scheduler
CSCW '94 Proceedings of the 1994 ACM conference on Computer supported cooperative work
Expected usability and product preference
DIS '97 Proceedings of the 2nd conference on Designing interactive systems: processes, practices, methods, and techniques
Satisfying user preferences while negotiating meetings
International Journal of Human-Computer Studies - Special issue: group support systems
The AARIA agent architecture: an example of requirements-driven agent-based system design
AGENTS '97 Proceedings of the first international conference on Autonomous agents
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proceedings of the first international conference on Information and computation economies
MusicFX: an arbiter of group preferences for computer supported collaborative workouts
CSCW '98 Proceedings of the 1998 ACM conference on Computer supported cooperative work
An adaptive interactive agent for route advice
Proceedings of the third annual conference on Autonomous Agents
A reinforcement learning agent for personalized information filtering
Proceedings of the 5th international conference on Intelligent user interfaces
Ranking engineering design concepts using a fuzzy outranking preference model
Fuzzy Sets and Systems
The WALRAS Algorithm: A Convergent Distributed Implementation of General Equilibrium Outcomes
Computational Economics
Agents and The Internet: Infrastructure for Mass Customization
IEEE Internet Computing
Distributed Manufacturing Scheduling Using Intelligent Agents
IEEE Intelligent Systems
Formalizing an Engineering Approach to Cooperating Knowledge-Based Systems
IEEE Transactions on Knowledge and Data Engineering
Exploring bidding strategies for market-based scheduling
Proceedings of the 4th ACM conference on Electronic commerce
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 1 - Volume 1
Multiple Negotiations among Agents for a Distributed Meeting Scheduler
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Agent-Based Approach to Dynamic Meeting Scheduling Problems
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Non-Preemptive Preferences in Multi-Agent Task Processing
DEXA '04 Proceedings of the Database and Expert Systems Applications, 15th International Workshop
An Engineering Approach to Cooperating Agents for Distributed Information Systems
Journal of Intelligent Information Systems
| Hi-index | 0.00 |
When multiple valid solutions are available to a problem, preferences can be used to indicate a choice. In a distributed system, such a preference-based solution can be produced autonomous agents cooperating together, but the attempt will lead to contention if the same resource is given preference by several user-agents. To resolve such contentions, this paper proposes a market-based payment scheme for selling and buying preferences by the contenders, in which the best solution is defined as the one where as many preferences as theoretically possible are globally met. After exploring the nature of preference, the paper develops a preference processing model based on the market based scheme, and presents a theoretical performance model to verify the correctness of the processing model. This verification is provided by a simulation study of the processing model.For the simulation study, a manufacturing environment is conjectured, where a set of tasks are resolved into subtasks by coordinator agents, and then these subtasks are allocated to assembler agents through cooperation and negotiation, in which preferred resources are exchanged against payments. The study shows that our agent based strategy not only produces convergence on the total preference value for the whole system, but also reaches that final value irrespective of the initial orderof subtask allocation to the assemblers.