Uncertainty in Bipolar Preference Problems
Identifieur interne : 002083 ( Istex/Corpus ); précédent : 002082; suivant : 002084Uncertainty in Bipolar Preference Problems
Auteurs : Stefano Bistarelli ; Maria Silvia Pini ; Francesca Rossi ; K. Brent VenableSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2007.
Abstract
Abstract: Preferences and uncertainty are common in many real-life problems. In this paper, we focus on bipolar preferences and on uncertainty modelled via uncontrollable variables. However, some information is provided for such variables, in the form of possibility distributions over their domains. To tackle such problems, we eliminate the uncertain part of the problem, making sure that some desirable properties hold about the robustness of the problem’s solutions and its relationship with their preference. We also define semantics to order the solutions according to different attitudes with respect to the notions of preference and robustness.
Url:
DOI: 10.1007/978-3-540-74970-7_55
Links to Exploration step
ISTEX:E3F19667743E66C68202FAB83243670F4D9B19F6Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Uncertainty in Bipolar Preference Problems</title><author><name sortKey="Bistarelli, Stefano" sort="Bistarelli, Stefano" uniqKey="Bistarelli S" first="Stefano" last="Bistarelli">Stefano Bistarelli</name><affiliation><mods:affiliation>Dipartimento di Scienze, Università “G. d’Annunzio”, Pescara, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>Istituto di Informatica e Telematica, CNR, Pisa, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: Stefano.Bistarelli@iit.cnr.it</mods:affiliation></affiliation></author><author><name sortKey="Pini, Maria Silvia" sort="Pini, Maria Silvia" uniqKey="Pini M" first="Maria Silvia" last="Pini">Maria Silvia Pini</name><affiliation><mods:affiliation>Dipartimento di Matematica Pura ed Applicata, Università di Padova, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: mpini@math.unipd.it</mods:affiliation></affiliation></author><author><name sortKey="Rossi, Francesca" sort="Rossi, Francesca" uniqKey="Rossi F" first="Francesca" last="Rossi">Francesca Rossi</name><affiliation><mods:affiliation>Dipartimento di Matematica Pura ed Applicata, Università di Padova, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: frossi@math.unipd.it</mods:affiliation></affiliation></author><author><name sortKey="Venable, K Brent" sort="Venable, K Brent" uniqKey="Venable K" first="K. Brent" last="Venable">K. Brent Venable</name><affiliation><mods:affiliation>Dipartimento di Matematica Pura ed Applicata, Università di Padova, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: kvenable@math.unipd.it</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:E3F19667743E66C68202FAB83243670F4D9B19F6</idno><date when="2007" year="2007">2007</date><idno type="doi">10.1007/978-3-540-74970-7_55</idno><idno type="url">https://api.istex.fr/document/E3F19667743E66C68202FAB83243670F4D9B19F6/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">002083</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002083</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Uncertainty in Bipolar Preference Problems</title><author><name sortKey="Bistarelli, Stefano" sort="Bistarelli, Stefano" uniqKey="Bistarelli S" first="Stefano" last="Bistarelli">Stefano Bistarelli</name><affiliation><mods:affiliation>Dipartimento di Scienze, Università “G. d’Annunzio”, Pescara, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>Istituto di Informatica e Telematica, CNR, Pisa, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: Stefano.Bistarelli@iit.cnr.it</mods:affiliation></affiliation></author><author><name sortKey="Pini, Maria Silvia" sort="Pini, Maria Silvia" uniqKey="Pini M" first="Maria Silvia" last="Pini">Maria Silvia Pini</name><affiliation><mods:affiliation>Dipartimento di Matematica Pura ed Applicata, Università di Padova, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: mpini@math.unipd.it</mods:affiliation></affiliation></author><author><name sortKey="Rossi, Francesca" sort="Rossi, Francesca" uniqKey="Rossi F" first="Francesca" last="Rossi">Francesca Rossi</name><affiliation><mods:affiliation>Dipartimento di Matematica Pura ed Applicata, Università di Padova, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: frossi@math.unipd.it</mods:affiliation></affiliation></author><author><name sortKey="Venable, K Brent" sort="Venable, K Brent" uniqKey="Venable K" first="K. Brent" last="Venable">K. Brent Venable</name><affiliation><mods:affiliation>Dipartimento di Matematica Pura ed Applicata, Università di Padova, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: kvenable@math.unipd.it</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2007</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">E3F19667743E66C68202FAB83243670F4D9B19F6</idno><idno type="DOI">10.1007/978-3-540-74970-7_55</idno><idno type="ChapterID">55</idno><idno type="ChapterID">Chap55</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Preferences and uncertainty are common in many real-life problems. In this paper, we focus on bipolar preferences and on uncertainty modelled via uncontrollable variables. However, some information is provided for such variables, in the form of possibility distributions over their domains. To tackle such problems, we eliminate the uncertain part of the problem, making sure that some desirable properties hold about the robustness of the problem’s solutions and its relationship with their preference. We also define semantics to order the solutions according to different attitudes with respect to the notions of preference and robustness.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Stefano Bistarelli</name><affiliations><json:string>Dipartimento di Scienze, Università “G. d’Annunzio”, Pescara, Italy</json:string><json:string>Istituto di Informatica e Telematica, CNR, Pisa, Italy</json:string><json:string>E-mail: Stefano.Bistarelli@iit.cnr.it</json:string></affiliations></json:item><json:item><name>Maria Silvia Pini</name><affiliations><json:string>Dipartimento di Matematica Pura ed Applicata, Università di Padova, Italy</json:string><json:string>E-mail: mpini@math.unipd.it</json:string></affiliations></json:item><json:item><name>Francesca Rossi</name><affiliations><json:string>Dipartimento di Matematica Pura ed Applicata, Università di Padova, Italy</json:string><json:string>E-mail: frossi@math.unipd.it</json:string></affiliations></json:item><json:item><name>K. Brent Venable</name><affiliations><json:string>Dipartimento di Matematica Pura ed Applicata, Università di Padova, Italy</json:string><json:string>E-mail: kvenable@math.unipd.it</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><abstract>Abstract: Preferences and uncertainty are common in many real-life problems. In this paper, we focus on bipolar preferences and on uncertainty modelled via uncontrollable variables. However, some information is provided for such variables, in the form of possibility distributions over their domains. To tackle such problems, we eliminate the uncertain part of the problem, making sure that some desirable properties hold about the robustness of the problem’s solutions and its relationship with their preference. We also define semantics to order the solutions according to different attitudes with respect to the notions of preference and robustness.</abstract><qualityIndicators><score>5.706</score><pdfVersion>1.3</pdfVersion><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>652</abstractCharCount><pdfWordCount>4566</pdfWordCount><pdfCharCount>22195</pdfCharCount><pdfPageCount>8</pdfPageCount><abstractWordCount>95</abstractWordCount></qualityIndicators><title>Uncertainty in Bipolar Preference Problems</title><genre.original><json:string>OriginalPaper</json:string></genre.original><chapterId><json:string>55</json:string><json:string>Chap55</json:string></chapterId><genre><json:string>conference [eBooks]</json:string></genre><serie><editor><json:item><name>David Hutchison</name></json:item><json:item><name>Takeo Kanade</name></json:item><json:item><name>Josef Kittler</name></json:item><json:item><name>Jon M. Kleinberg</name></json:item><json:item><name>Friedemann Mattern</name></json:item><json:item><name>John C. Mitchell</name></json:item><json:item><name>Moni Naor</name></json:item><json:item><name>Oscar Nierstrasz</name></json:item><json:item><name>C. Pandu Rangan</name></json:item><json:item><name>Bernhard Steffen</name></json:item><json:item><name>Madhu Sudan</name></json:item><json:item><name>Demetri Terzopoulos</name></json:item><json:item><name>Doug Tygar</name></json:item><json:item><name>Moshe Y. Vardi</name></json:item><json:item><name>Gerhard Weikum</name></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2007</copyrightDate></serie><host><editor><json:item><name>Christian Bessière</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Programming Techniques</value></json:item><json:item><value>Programming Languages, Compilers, Interpreters</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Computer Appl. in Administrative Data Processing</value></json:item></subject><isbn><json:string>978-3-540-74969-1</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Principles and Practice of Constraint Programming – CP 2007</title><genre.original><json:string>Proceedings</json:string></genre.original><bookId><json:string>978-3-540-74970-7</json:string></bookId><volume>4741</volume><pages><last>789</last><first>782</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>Book Series</json:string></genre><eisbn><json:string>978-3-540-74970-7</json:string></eisbn><copyrightDate>2007</copyrightDate><doi><json:string>10.1007/978-3-540-74970-7</json:string></doi></host><publicationDate>2007</publicationDate><copyrightDate>2007</copyrightDate><doi><json:string>10.1007/978-3-540-74970-7_55</json:string></doi><id>E3F19667743E66C68202FAB83243670F4D9B19F6</id><score>1</score><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/E3F19667743E66C68202FAB83243670F4D9B19F6/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/E3F19667743E66C68202FAB83243670F4D9B19F6/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/E3F19667743E66C68202FAB83243670F4D9B19F6/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Uncertainty in Bipolar Preference Problems</title><respStmt xml:id="ISTEX-API" resp="Références bibliographiques récupérées via GROBID" name="ISTEX-API (INIST-CNRS)"></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>SPRINGER</p></availability><date>2007</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Uncertainty in Bipolar Preference Problems</title><author><persName><forename type="first">Stefano</forename><surname>Bistarelli</surname></persName><email>Stefano.Bistarelli@iit.cnr.it</email><affiliation>Dipartimento di Scienze, Università “G. d’Annunzio”, Pescara, Italy</affiliation><affiliation>Istituto di Informatica e Telematica, CNR, Pisa, Italy</affiliation></author><author><persName><forename type="first">Maria</forename><surname>Pini</surname></persName><email>mpini@math.unipd.it</email><affiliation>Dipartimento di Matematica Pura ed Applicata, Università di Padova, Italy</affiliation></author><author><persName><forename type="first">Francesca</forename><surname>Rossi</surname></persName><email>frossi@math.unipd.it</email><affiliation>Dipartimento di Matematica Pura ed Applicata, Università di Padova, Italy</affiliation></author><author><persName><forename type="first">K.</forename><surname>Venable</surname></persName><email>kvenable@math.unipd.it</email><affiliation>Dipartimento di Matematica Pura ed Applicata, Università di Padova, Italy</affiliation></author></analytic><monogr><title level="m">Principles and Practice of Constraint Programming – CP 2007</title><title level="m" type="sub">13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007. Proceedings</title><idno type="pISBN">978-3-540-74969-1</idno><idno type="eISBN">978-3-540-74970-7</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/978-3-540-74970-7</idno><idno type="BookID">978-3-540-74970-7</idno><idno type="BookTitleID">152686</idno><idno type="BookSequenceNumber">4741</idno><idno type="BookVolumeNumber">4741</idno><idno type="BookChapterCount">67</idno><editor><persName><forename type="first">Christian</forename><surname>Bessière</surname></persName></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2007"></date><biblScope unit="volume">4741</biblScope><biblScope unit="page" from="782">782</biblScope><biblScope unit="page" to="789">789</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName></editor><editor><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName></editor><biblScope><date>2007</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesId">558</idno></series><idno type="istex">E3F19667743E66C68202FAB83243670F4D9B19F6</idno><idno type="DOI">10.1007/978-3-540-74970-7_55</idno><idno type="ChapterID">55</idno><idno type="ChapterID">Chap55</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2007</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: Preferences and uncertainty are common in many real-life problems. In this paper, we focus on bipolar preferences and on uncertainty modelled via uncontrollable variables. However, some information is provided for such variables, in the form of possibility distributions over their domains. To tackle such problems, we eliminate the uncertain part of the problem, making sure that some desirable properties hold about the robustness of the problem’s solutions and its relationship with their preference. We also define semantics to order the solutions according to different attitudes with respect to the notions of preference and robustness.</p></abstract><textClass><keywords scheme="Book Subject Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book Subject Group"><list><label>I</label><label>I14010</label><label>I14037</label><label>I21017</label><label>I1603X</label><label>I16048</label><label>I2301X</label><item><term>Computer Science</term></item><item><term>Programming Techniques</term></item><item><term>Programming Languages, Compilers, Interpreters</term></item><item><term>Artificial Intelligence (incl. Robotics)</term></item><item><term>Logics and Meanings of Programs</term></item><item><term>Mathematical Logic and Formal Languages</term></item><item><term>Computer Appl. in Administrative Data Processing</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2007">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-3-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/E3F19667743E66C68202FAB83243670F4D9B19F6/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" OutputMedium="All" TocLevels="0"><BookID>978-3-540-74970-7</BookID><BookTitle>Principles and Practice of Constraint Programming – CP 2007</BookTitle><BookSubTitle>13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007. Proceedings</BookSubTitle><BookVolumeNumber>4741</BookVolumeNumber><BookSequenceNumber>4741</BookSequenceNumber><BookDOI>10.1007/978-3-540-74970-7</BookDOI><BookTitleID>152686</BookTitleID><BookPrintISBN>978-3-540-74969-1</BookPrintISBN><BookElectronicISBN>978-3-540-74970-7</BookElectronicISBN><BookChapterCount>67</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2007</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I14010" Priority="1" Type="Secondary">Programming Techniques</BookSubject><BookSubject Code="I14037" Priority="2" Type="Secondary">Programming Languages, Compilers, Interpreters</BookSubject><BookSubject Code="I21017" Priority="3" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I1603X" Priority="4" Type="Secondary">Logics and Meanings of Programs</BookSubject><BookSubject Code="I16048" Priority="5" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I2301X" Priority="6" Type="Secondary">Computer Appl. in Administrative Data Processing</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Christian</GivenName><FamilyName>Bessière</FamilyName></EditorName><Contact><Email>bessiere@lirmm.fr</Email></Contact></Editor></EditorGroup></BookHeader><Part ID="Part4"><PartInfo TocLevels="0"><PartID>4</PartID><PartSequenceNumber>4</PartSequenceNumber><PartTitle>Short Research Papers</PartTitle><PartChapterCount>14</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Principles and Practice of Constraint Programming – CP 2007</BookTitle></PartContext></PartInfo><Chapter ID="Chap55" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>55</ChapterID><ChapterDOI>10.1007/978-3-540-74970-7_55</ChapterDOI><ChapterSequenceNumber>55</ChapterSequenceNumber><ChapterTitle Language="En">Uncertainty in Bipolar Preference Problems</ChapterTitle><ChapterFirstPage>782</ChapterFirstPage><ChapterLastPage>789</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2007</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>4</PartID><BookID>978-3-540-74970-7</BookID><BookTitle>Principles and Practice of Constraint Programming – CP 2007</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1 Aff2"><AuthorName DisplayOrder="Western"><GivenName>Stefano</GivenName><FamilyName>Bistarelli</FamilyName></AuthorName><Contact><Email>Stefano.Bistarelli@iit.cnr.it</Email></Contact></Author><Author AffiliationIDS="Aff3"><AuthorName DisplayOrder="Western"><GivenName>Maria</GivenName><GivenName>Silvia</GivenName><FamilyName>Pini</FamilyName></AuthorName><Contact><Email>mpini@math.unipd.it</Email></Contact></Author><Author AffiliationIDS="Aff3"><AuthorName DisplayOrder="Western"><GivenName>Francesca</GivenName><FamilyName>Rossi</FamilyName></AuthorName><Contact><Email>frossi@math.unipd.it</Email></Contact></Author><Author AffiliationIDS="Aff3"><AuthorName DisplayOrder="Western"><GivenName>K.</GivenName><GivenName>Brent</GivenName><FamilyName>Venable</FamilyName></AuthorName><Contact><Email>kvenable@math.unipd.it</Email></Contact></Author><Affiliation ID="Aff1"><OrgName>Dipartimento di Scienze, Università “G. d’Annunzio”, Pescara</OrgName><OrgAddress><Country>Italy</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Istituto di Informatica e Telematica, CNR, Pisa</OrgName><OrgAddress><Country>Italy</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>Dipartimento di Matematica Pura ed Applicata, Università di Padova</OrgName><OrgAddress><Country>Italy</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>Preferences and uncertainty are common in many real-life problems. In this paper, we focus on bipolar preferences and on uncertainty modelled via uncontrollable variables. However, some information is provided for such variables, in the form of possibility distributions over their domains. To tackle such problems, we eliminate the uncertain part of the problem, making sure that some desirable properties hold about the robustness of the problem’s solutions and its relationship with their preference. We also define semantics to order the solutions according to different attitudes with respect to the notions of preference and robustness.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Uncertainty in Bipolar Preference Problems</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Uncertainty in Bipolar Preference Problems</title></titleInfo><name type="personal"><namePart type="given">Stefano</namePart><namePart type="family">Bistarelli</namePart><affiliation>Dipartimento di Scienze, Università “G. d’Annunzio”, Pescara, Italy</affiliation><affiliation>Istituto di Informatica e Telematica, CNR, Pisa, Italy</affiliation><affiliation>E-mail: Stefano.Bistarelli@iit.cnr.it</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Maria</namePart><namePart type="given">Silvia</namePart><namePart type="family">Pini</namePart><affiliation>Dipartimento di Matematica Pura ed Applicata, Università di Padova, Italy</affiliation><affiliation>E-mail: mpini@math.unipd.it</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Francesca</namePart><namePart type="family">Rossi</namePart><affiliation>Dipartimento di Matematica Pura ed Applicata, Università di Padova, Italy</affiliation><affiliation>E-mail: frossi@math.unipd.it</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">K.</namePart><namePart type="given">Brent</namePart><namePart type="family">Venable</namePart><affiliation>Dipartimento di Matematica Pura ed Applicata, Università di Padova, Italy</affiliation><affiliation>E-mail: kvenable@math.unipd.it</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference [eBooks]" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2007</dateIssued><copyrightDate encoding="w3cdtf">2007</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: Preferences and uncertainty are common in many real-life problems. In this paper, we focus on bipolar preferences and on uncertainty modelled via uncontrollable variables. However, some information is provided for such variables, in the form of possibility distributions over their domains. To tackle such problems, we eliminate the uncertain part of the problem, making sure that some desirable properties hold about the robustness of the problem’s solutions and its relationship with their preference. We also define semantics to order the solutions according to different attitudes with respect to the notions of preference and robustness.</abstract><relatedItem type="host"><titleInfo><title>Principles and Practice of Constraint Programming – CP 2007</title><subTitle>13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Christian</namePart><namePart type="family">Bessière</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="Book Series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2007</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book Subject Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book Subject Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I14010">Programming Techniques</topic><topic authority="SpringerSubjectCodes" authorityURI="I14037">Programming Languages, Compilers, Interpreters</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I2301X">Computer Appl. in Administrative Data Processing</topic></subject><identifier type="DOI">10.1007/978-3-540-74970-7</identifier><identifier type="ISBN">978-3-540-74969-1</identifier><identifier type="eISBN">978-3-540-74970-7</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">152686</identifier><identifier type="BookID">978-3-540-74970-7</identifier><identifier type="BookChapterCount">67</identifier><identifier type="BookVolumeNumber">4741</identifier><identifier type="BookSequenceNumber">4741</identifier><identifier type="PartChapterCount">14</identifier><part><date>2007</date><detail type="part"><title>Short Research Papers</title></detail><detail type="volume"><number>4741</number><caption>vol.</caption></detail><extent unit="pages"><start>782</start><end>789</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2007</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2007</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2007</recordOrigin></recordInfo></relatedItem><identifier type="istex">E3F19667743E66C68202FAB83243670F4D9B19F6</identifier><identifier type="DOI">10.1007/978-3-540-74970-7_55</identifier><identifier type="ChapterID">55</identifier><identifier type="ChapterID">Chap55</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2007</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2007</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/TelematiV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002083 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002083 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= TelematiV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:E3F19667743E66C68202FAB83243670F4D9B19F6
|texte= Uncertainty in Bipolar Preference Problems
}}
| This area was generated with Dilib version V0.6.31. |  |