We consider constraint optimization problems where costs (or preferences) are all given, but some are tagged as possibly unstable, and provided with a range of alternative values. ...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
Many problems in information extraction, text mining, natural language processing and other fields exhibit the same property: multiple prediction tasks are related in the sense th...
The concept of distance rationalizability allows one to define new voting rules or "rationalize" existing ones via a consensus class of elections and a distance. A conse...
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
Undersea localization requires a computationally expensive partial differential equation simulation to test each candidate hypothesis location via matched filter. We propose a met...
As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal sc...