2026-09-18T21:47:32Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/168422022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
John Doyle.
McGeachie, Michael J
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2005-05-19T14:59:38Z
2005-05-19T14:59:38Z
2002
2002
http://hdl.handle.net/1721.1/16842
51441242
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.
103 p.
530454 bytes
530140 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
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
Electrical Engineering and Computer Science.
Utility functions for ceteris paribus preferences
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="124e24b9-8926-44b0-86f5-23989e9ef8fe">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Utility functions for ceteris paribus preferences</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2002</PublicationDate>
<Authors>
<Author>
<DisplayName>McGeachie, Michael J</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>