Reasoning with PCP-Nets

Cristina Cornelio; Judy Goldsmith; Umberto Grandi; Nicholas Mattei; Francesca Rossi; K. Brent Venable

doi:10.1613/JAIR.1.13009

Reasoning with PCP-Nets

Cristina Cornelio, Judy Goldsmith, Umberto Grandi, Nicholas Mattei, Francesca Rossi, K. Brent Venable

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

We introduce PCP-nets, a formalism to model qualitative conditional preferences with probabilistic uncertainty. PCP-nets generalise CP-nets by allowing for uncertainty over the preference orderings. We define and study both optimality and dominance queries in PCP-nets, and we propose a tractable approximation of dominance which we show to be very accurate in our experimental setting. Since PCP-nets can be seen as a way to model a collection of weighted CP-nets, we also explore the use of PCP-nets in a multi-agent context, where individual agents submit CP-nets which are then aggregated into a single PCP-net. We consider various ways to perform such aggregation and we compare them via two notions of scores, based on well known voting theory concepts. Experimental results allow us to identify the aggregation method that better represents the given set of CP-nets and the most efficient dominance procedure to be used in the multi-agent context.

Original language	English
Pages (from-to)	1103-1161
Number of pages	59
Journal	Journal of Artificial Intelligence Research
Volume	72
DOIs	https://doi.org/10.1613/JAIR.1.13009
State	Published - 2021

Bibliographical note

Funding Information:
Judy Goldsmith’s work was partially supported by NSF grant IIS-1649152. The work of Cristina Cornelio and Francesca Rossi was partially supported by the University of Padova project “Incorporating patients’ preferences in kidney transplant decision protocols”. The work of Cristina Cor-nelio was partially done while at IBM Research. Nicholas Mattei’s work was partially supported by NICTA, funded by the Australian Government through the Department of Communications and the Australian Research Council through the ICT Centre of Excellence Program. The work of Nicholas Mattei was also partially done while at IBM Research. We would also like to thank the anonymous referees whose careful feedback made this a better paper than it had been.

Publisher Copyright:
© 2021 AI Access Foundation. All rights reserved.

ASJC Scopus subject areas

Artificial Intelligence

Access to Document

10.1613/JAIR.1.13009

Cite this

@article{6ba9b850c7874bd992ee8184ef7024e4,

title = "Reasoning with PCP-Nets",

abstract = "We introduce PCP-nets, a formalism to model qualitative conditional preferences with probabilistic uncertainty. PCP-nets generalise CP-nets by allowing for uncertainty over the preference orderings. We define and study both optimality and dominance queries in PCP-nets, and we propose a tractable approximation of dominance which we show to be very accurate in our experimental setting. Since PCP-nets can be seen as a way to model a collection of weighted CP-nets, we also explore the use of PCP-nets in a multi-agent context, where individual agents submit CP-nets which are then aggregated into a single PCP-net. We consider various ways to perform such aggregation and we compare them via two notions of scores, based on well known voting theory concepts. Experimental results allow us to identify the aggregation method that better represents the given set of CP-nets and the most efficient dominance procedure to be used in the multi-agent context.",

author = "Cristina Cornelio and Judy Goldsmith and Umberto Grandi and Nicholas Mattei and Francesca Rossi and {Brent Venable}, K.",

note = "Funding Information: Judy Goldsmith{\textquoteright}s work was partially supported by NSF grant IIS-1649152. The work of Cristina Cornelio and Francesca Rossi was partially supported by the University of Padova project “Incorporating patients{\textquoteright} preferences in kidney transplant decision protocols”. The work of Cristina Cor-nelio was partially done while at IBM Research. Nicholas Mattei{\textquoteright}s work was partially supported by NICTA, funded by the Australian Government through the Department of Communications and the Australian Research Council through the ICT Centre of Excellence Program. The work of Nicholas Mattei was also partially done while at IBM Research. We would also like to thank the anonymous referees whose careful feedback made this a better paper than it had been. Publisher Copyright: {\textcopyright} 2021 AI Access Foundation. All rights reserved.",

year = "2021",

doi = "10.1613/JAIR.1.13009",

language = "English",

volume = "72",

pages = "1103--1161",

}

TY - JOUR

T1 - Reasoning with PCP-Nets

AU - Cornelio, Cristina

AU - Goldsmith, Judy

AU - Grandi, Umberto

AU - Mattei, Nicholas

AU - Rossi, Francesca

AU - Brent Venable, K.

N1 - Funding Information: Judy Goldsmith’s work was partially supported by NSF grant IIS-1649152. The work of Cristina Cornelio and Francesca Rossi was partially supported by the University of Padova project “Incorporating patients’ preferences in kidney transplant decision protocols”. The work of Cristina Cor-nelio was partially done while at IBM Research. Nicholas Mattei’s work was partially supported by NICTA, funded by the Australian Government through the Department of Communications and the Australian Research Council through the ICT Centre of Excellence Program. The work of Nicholas Mattei was also partially done while at IBM Research. We would also like to thank the anonymous referees whose careful feedback made this a better paper than it had been. Publisher Copyright: © 2021 AI Access Foundation. All rights reserved.

PY - 2021

Y1 - 2021

N2 - We introduce PCP-nets, a formalism to model qualitative conditional preferences with probabilistic uncertainty. PCP-nets generalise CP-nets by allowing for uncertainty over the preference orderings. We define and study both optimality and dominance queries in PCP-nets, and we propose a tractable approximation of dominance which we show to be very accurate in our experimental setting. Since PCP-nets can be seen as a way to model a collection of weighted CP-nets, we also explore the use of PCP-nets in a multi-agent context, where individual agents submit CP-nets which are then aggregated into a single PCP-net. We consider various ways to perform such aggregation and we compare them via two notions of scores, based on well known voting theory concepts. Experimental results allow us to identify the aggregation method that better represents the given set of CP-nets and the most efficient dominance procedure to be used in the multi-agent context.

AB - We introduce PCP-nets, a formalism to model qualitative conditional preferences with probabilistic uncertainty. PCP-nets generalise CP-nets by allowing for uncertainty over the preference orderings. We define and study both optimality and dominance queries in PCP-nets, and we propose a tractable approximation of dominance which we show to be very accurate in our experimental setting. Since PCP-nets can be seen as a way to model a collection of weighted CP-nets, we also explore the use of PCP-nets in a multi-agent context, where individual agents submit CP-nets which are then aggregated into a single PCP-net. We consider various ways to perform such aggregation and we compare them via two notions of scores, based on well known voting theory concepts. Experimental results allow us to identify the aggregation method that better represents the given set of CP-nets and the most efficient dominance procedure to be used in the multi-agent context.

UR - http://www.scopus.com/inward/record.url?scp=85122155013&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85122155013&partnerID=8YFLogxK

U2 - 10.1613/JAIR.1.13009

DO - 10.1613/JAIR.1.13009

M3 - Article

AN - SCOPUS:85122155013

VL - 72

SP - 1103

EP - 1161

ER -

Reasoning with PCP-Nets

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this