Distributed Scheduling of Tasks with Deadlines and Resource Requirements
IEEE Transactions on Computers
Impediments to universal preference-based default theories
Artificial Intelligence - Special issue on knowledge representation
Reaching agreement through partial revelation of preferences
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
An experiment in the design of software agents
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Knowledge-Based Approaches for Scheduling Problems: A Survey
IEEE Transactions on Knowledge and Data Engineering
Multi-Agent Planning as Search for a Consensus that Maximizes Social Welfare
MAAMAW '92 Selected papers from the 4th European Workshop on on Modelling Autonomous Agents in a Multi-Agent World, Artificial Social Systems
COCS '95 Proceedings of conference on Organizational computing systems
Simulated social control for secure Internet commerce
NSPW '96 Proceedings of the 1996 workshop on New security paradigms
Intertwining perspectives and negotiation
GROUP '99 Proceedings of the international ACM SIGGROUP conference on Supporting group work
Temporal Coordination –On Time and Coordination of CollaborativeActivities at a Surgical Department
Computer Supported Cooperative Work
Mixed-Initiative Issues in an Agent-Based Meeting Scheduler
User Modeling and User-Adapted Interaction
Agents, self-interest and electronic markets
The Knowledge Engineering Review
A preference processing model for cooperative agents
Journal of Intelligent Information Systems
Moving out of the meeting room: exploring support for mobile meetings
ECSCW'99 Proceedings of the sixth conference on European Conference on Computer Supported Cooperative Work
Scheduling meetings through multi-agent negotiations
Decision Support Systems
Privacy-preserving activity scheduling on mobile devices
Proceedings of the first ACM conference on Data and application security and privacy
| Hi-index | 0.00 |
In this paper we present three scheduling mechanisms that are manipulation-proof for closed systems. The amount of information that each user must encode in the mechanism increases with the complexity of the mechanism. On the other hand, the more complex the mechanism is, the more it maintains the privacy of the users.The first mechanism is a centralized, calendar-oriented one. It is the least computationally complex of the three, but does not maintain user privacy. The second is a distributed meeting-oriented mechanism that maintains user privacy, but at the cost of greater computational complexity. The third mechanism, while being the most complex, maintains user privacy (for the most part) and allows users to have the greatest influence on the resulting schedule.