Balancing Optimality and Robustness in Resource Allocation Problems

Authors:
Víctor Muòoz;Dídac Busquets
Affiliations:
Institut d'Informàtica i Aplicacions, Universitat de Girona, Girona, Spain, email: {victor.munyoz, didac.busquets}@udg.edu;Institut d'Informàtica i Aplicacions, Universitat de Girona, Girona, Spain, email: {victor.munyoz, didac.busquets}@udg.edu
Venue:
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Year:
2010

Citing 5
Cited 0

Supermodels and robustness

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Towards a universal test suite for combinatorial auction algorithms

Proceedings of the 2nd ACM conference on Electronic commerce
Robust solutions for combinatorial auctions

Proceedings of the 6th ACM conference on Electronic commerce
A logical approach to efficient Max-SAT solving

Artificial Intelligence
A declarative approach to robust weighted Max-SAT

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We formally define a flexible robustness mechanism for resource allocation problems encoded as combinatorial auctions based on repairable solutions. Our notion of robustness is focused on resources that become unavailable once an allocation has been found. We extend previous works on encoding auctions to weighted Max-SAT and supermodels for the boolean satisfiability framework (SAT) with a mechanism that adds flexibility to the robust solutions.