A Formal Study of Distributed Meeting Scheduling
dc.contributor.author | Sen, Sandip | en_US |
dc.contributor.author | Durfee, Edmund H. | en_US |
dc.date.accessioned | 2006-09-08T20:46:09Z | |
dc.date.available | 2006-09-08T20:46:09Z | |
dc.date.issued | 1998-05 | en_US |
dc.identifier.citation | Sen, Sandip; Durfee, Edmund H.; (1998). "A Formal Study of Distributed Meeting Scheduling." Group Decision and Negotiation 7(3): 265-289. <http://hdl.handle.net/2027.42/42829> | en_US |
dc.identifier.issn | 0926-2644 | en_US |
dc.identifier.issn | 1572-9907 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/42829 | |
dc.description.abstract | Automating routine organizational tasks, such as meeting scheduling, requires a careful balance between the individual (respecting his or her privacy and personal preferences) and the organization (making efficient use of time and other resources). We argue that meeting scheduling is an inherently distributed process, and that negotiating over meetings can be viewed as a distributed search process. Keeping the process tractable requires introducing heuristics to guide distributed schedulers' decisions about what information to exchange and whether or not to propose the same tentative time for several meetings. While we have intuitions about how such heuristics could affect scheduling performance and efficiency, verifying these intuitions requires a more formal model of the meeting schedule problem and process. We present our preliminary work toward this goal, as well as experimental results that validate some of the predictions of our formal model. We also investigate scheduling in overconstrained situations, namely, scheduling of high priority meetings at short notice, which requires cancellation and rescheduling of previously scheduled meetings. Our model provides a springboard into deeper investigations of important issues in distributed artificial intelligence as well, and we outline our ongoing work in this direction. | en_US |
dc.format.extent | 109769 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers; Springer Science+Business Media | en_US |
dc.subject.other | Economics / Management Science | en_US |
dc.subject.other | Operation Research/Decision Theory | en_US |
dc.subject.other | Meeting Scheduling | en_US |
dc.subject.other | Intelligent Agents | en_US |
dc.subject.other | Distributed AI | en_US |
dc.subject.other | Probabilistic Model | en_US |
dc.subject.other | Discrete Event Simulation | en_US |
dc.title | A Formal Study of Distributed Meeting Scheduling | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Management | en_US |
dc.subject.hlbsecondlevel | Urban Planning | en_US |
dc.subject.hlbsecondlevel | Economics | en_US |
dc.subject.hlbsecondlevel | Business (General) | en_US |
dc.subject.hlbtoplevel | Business | en_US |
dc.subject.hlbtoplevel | Social Sciences | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of EECS, University of Michigan, 1101 Beal Avenue, Ann Arbor, MI, 48109 | en_US |
dc.contributor.affiliationother | Department of Mathematical and Computer Sciences, University of Tulsa, 600 South College Avenue, Tulsa, UK, 74104-3189 | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/42829/1/10726_2004_Article_153020.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1023/A:1008639617029 | en_US |
dc.identifier.source | Group Decision and Negotiation | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.