We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
Moshe Babaioff, Jason D. Hartline, Robert D. Klein...
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
Abstract. This paper addresses the problem of merging qualitative constraint networks (QCNs) defined on different qualitative formalisms. Our model is restricted to formalisms wher...