Examination timetabling problems are often solved by a two-phase procedure combining a sequential construction heuristic with a metaheuristic improvement search. There can be many...
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
Exemplar-based clustering methods have been shown to produce state-of-the-art results on a number of synthetic and real-world clustering problems. They are appealing because they ...
We discuss a solution to the winner determination problem which takes into account not only costs but also risk aversion of the agent that accepts the bids. We are interested in b...