Units of a good are produced at some symmetric cost. A mechanism elicits agents’ willingness to pay for one unit of the good, allocates some goods to some agents, and covers the cost by charging those agents. We introduce the generalized average cost mechanism (GAC) for arbitrary symmetric cost functions. GAC is the only Pareto selection among group strategyproof mechanisms that treat equal age...

In this paper, we propose a framework for learning the parameters of registration cost functions--such as the tradeoff between the regularization and image similiarity term--with respect to a specific task. Assuming the existence of labeled training data, we specialize the framework for the task of localizing hidden labels via image registration. We learn the parameters of the weighted sum of s...

When looking for new and faster parallel sorting algorithms for use in massively parallel systems it is tempting to investigate promising alternatives from the large body of research done on parallel sorting in the eld of theoretical computer science. Such \theoretical" algorithms are mainly described for the PRAM (Parallel Random Access Machine) model of computation 13, 26]. This paper shows h...

Planning landmarks are facts that must be true at some point in every solution plan. Previous work has very successfully exploited planning landmarks in satisficing (non-optimal) planning. We propose a methodology for deriving admissible heuristic estimates for cost-optimal planning from a set of planning landmarks. The resulting heuristics fall into a novel class of multi-path dependent heuris...