Utility functions for ceteris paribus preferences
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/16842 |
| _version_ | 1811070437684150272 |
|---|---|
| author | McGeachie, Michael J |
| author2 | John Doyle. |
| author_facet | John Doyle. McGeachie, Michael J |
| author_sort | McGeachie, Michael J |
| collection | MIT |
| description | Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002. |
| first_indexed | 2024-09-23T08:36:00Z |
| format | Thesis |
| id | mit-1721.1/16842 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T08:36:00Z |
| publishDate | 2005 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/168422019-04-09T18:41:11Z Utility functions for ceteris paribus preferences McGeachie, Michael J John Doyle. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002. Includes bibliographical references (p. 101-103). This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. Ceteris paribus preference statements concisely represent preferences over outcomes or goals in a way natural to human thinking. Many decision making methods require an efficient method for comparing the desirability of two arbitrary goals. We address this need by presenting an algorithm for converting a set of qualitative ceteris paribus preferences into a quantitative utility function. Our algorithm is complete for a finite universe of binary features. Constructing the utility function can, in the worst case, take time exponential in the number of features. Common forms of independence conditions reduce the computational burden. We present heuristics using utility independence and constraint based search to achieve efficient utility functions. by Michael McGeachie. S.M. 2005-05-19T14:59:38Z 2005-05-19T14:59:38Z 2002 2002 Thesis http://hdl.handle.net/1721.1/16842 51441242 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 103 p. 530454 bytes 530140 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. McGeachie, Michael J Utility functions for ceteris paribus preferences |
| title | Utility functions for ceteris paribus preferences |
| title_full | Utility functions for ceteris paribus preferences |
| title_fullStr | Utility functions for ceteris paribus preferences |
| title_full_unstemmed | Utility functions for ceteris paribus preferences |
| title_short | Utility functions for ceteris paribus preferences |
| title_sort | utility functions for ceteris paribus preferences |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/16842 |
| work_keys_str_mv | AT mcgeachiemichaelj utilityfunctionsforceterisparibuspreferences |