* Faculty       * Staff       * Students & Alumni       * Committees       * Contact       * Institute Directory
* Undergraduate Program       * Graduate Program       * Courses       * Institute Catalog      
* Undergraduate       * Graduate       * Institute Admissions: Undergraduate | Graduate      
* Colloquia       * Seminars       * News       * Events       * Institute Events      
* Overview       * Lab Manual       * Institute Computing      
No Menu Selected

* News

Colloquia

Probabilistic conditional preferences

Speaker: Francesca Rossi
University of Padova

March 17, 2015 - 4:00 p.m. to 5:00 p.m.
Location: Troy 2018
Hosted By: Dr. Lirong Xia (x6720)

Abstract:

Preferences are ubiquitous in our everyday life. We use them to take all our decisions, either in isolation or together with others. They change over time and they get affected by our relationship with friends. We sometimes describe them explicitly but most often we show them implicitly via our actions (like clicks, follows, tweets, blogs, choices). Being able to model them faithfully and reason with them efficiently is essential in every intelligent environment. Several formalisms exist to handle preferences of various kinds: qualitative, quantitative, conditional, etc. However, they usually assume preferences to be certain and do not provide help for describing and reasoning with uncertain preferences. Uncertainty may be present in a single agent setting, where an individual is not sure about its preferences or some noise is present, or also in a multi-agent setting, where several individuals may have conflicting preferences and uncertainty may be used to reconcile them. Probabilistic CP-nets (PCP-nets) are a formalism to model conditional qualitative preferences with probabilistic uncertainty. Under reasonable restrictions on the topology of their dependency graph, it is computationally easy to perform various tasks in PCP-nets. Thus they provide an efficient tool to model and reason with preferences. In this talk, I will describe PCP-nets and how to respond to optimality and dominance queries over them. I will then advocate for the need of a logical language to model them, and hint at their possible use in various scenarios. I will also compare them to other frameworks and will discuss preference elicitation/learning issues.

Bio:

Francesca Rossi is a professor of computer science at the University of Padova, Italy. Currently she is on sabbatical at Harvard with a fellowship of the Radcliffe Institute for Advanced Studiy. Her research interests include: constraint reasoning, preferences, multi-agent systems, computational social choice and artificial intelligence. She has been president of the international association for constraint programming (ACP) and is now the president of IJCAI. She has been program chair of CP 2003 and of IJCAI 2013. She is on the editorial board of Constraints, Artificial Intelligence, AMAI and KAIS, and is Associate Editor in Chief of JAIR. She has published over 160 articles in international journals, proceedings of international conferences or workshops, and as book chapters. She has co-authored a book, edited 16 volumes of conference proceedings, collections of contributions, and special issue of international journals, and has co-edited the Handbook of Constraint Programming.

Last updated: March 10, 2015



---