Sciweavers

1260 search results - page 74 / 252
» Bipolar Preference Problems
Sort
View
EOR
2011
140views more  EOR 2011»
13 years 1 months ago
Compact bidding languages and supplier selection for markets with economies of scale and scope
Combinatorial auctions have been used in procurement markets with economies of scope. Preference elicitation is already a problem in single-unit combinatorial auctions, but it bec...
Martin Bichler, Stefan Schneider, Kemal Guler, Meh...
CP
2006
Springer
14 years 1 months ago
Propagation in CSP and SAT
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...
Yannis Dimopoulos, Kostas Stergiou
COLING
2008
13 years 11 months ago
Mining Opinions in Comparative Sentences
This paper studies sentiment analysis from the user-generated content on the Web. In particular, it focuses on mining opinions from comparative sentences, i.e., to determine which...
Murthy Ganapathibhotla, Bing Liu
CONSTRAINTS
1999
120views more  CONSTRAINTS 1999»
13 years 9 months ago
Refined Inequalities for Stable Marriage
We consider two approaches to the stable marriage problem: proposal algorithms and describing the stable matching polytope using linear inequalities. We illuminate the relationship...
Brian Aldershof, Olivia M. Carducci, David C. Lore...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 8 months ago
Approximate Judgement Aggregation
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
Ilan Nehama