Sciweavers

33 search results - page 3 / 7
» Complexity of terminating preference elicitation
Sort
View
IJCAI
2003
14 years 11 months ago
Incremental Utility Elicitation with the Minimax Regret Decision Criterion
Utility elicitation is a critical function of any automated decision aid, allowing decisions to be tailored to the preferences of a specific user. However, the size and complexit...
Tianhan Wang, Craig Boutilier
ECAI
2010
Springer
14 years 7 months ago
Learning conditionally lexicographic preference relations
Abstract. We consider the problem of learning a user's ordinal preferences on a multiattribute domain, assuming that her preferences are lexicographic. We introduce a general ...
Richard Booth, Yann Chevaleyre, Jérôm...
ECSA
2008
Springer
14 years 11 months ago
Automating Architecture Trade-Off Decision Making through a Complex Multi-attribute Decision Process
A typical software architecture design process requires the architects to make various trade-off architecture decisions. The architects need to consider different possibilities and...
Majid Makki, Ebrahim Bagheri, Ali A. Ghorbani
SIGECOM
2005
ACM
90views ECommerce» more  SIGECOM 2005»
15 years 3 months ago
ICE: an iterative combinatorial exchange
We present the first design for a fully expressive iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language that is concise and expressive ...
David C. Parkes, Ruggiero Cavallo, Nick Elprin, Ad...
JAIR
2008
103views more  JAIR 2008»
14 years 9 months ago
ICE: An Expressive Iterative Combinatorial Exchange
We present the design and analysis of the first fully expressive, iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language (TBBL) that is co...
Benjamin Lubin, Adam I. Juda, Ruggiero Cavallo, S&...