Skip to main content

Research Repository

Advanced Search

Efficient algorithms for checking avoiding sure loss

Nakharutai, Nawapon; Troffaes, Matthias C.M.; Caiado, Camila C.C.S.

Efficient algorithms for checking avoiding sure loss Thumbnail


Authors

Nawapon Nakharutai



Contributors

Alessandro Antonucci
Editor

Giorgio Corani
Editor

Inés Couso
Editor

Sébastien Destercke
Editor

Abstract

Sets of desirable gambles provide a general representation of uncertainty which can handle partial information in a more robust way than precise probabilities. Here we study the effectiveness of linear programming algorithms for determining whether or not a given set of desirable gambles avoids sure loss (i.e. is consistent). We also suggest improvements to these algorithms specifically for checking avoiding sure loss. By exploiting the structure of the problem, (i) we slightly reduce its dimension, (ii) we propose an extra stopping criterion based on its degenerate structure, and (iii) we show that one can directly calculate feasible starting points in various cases, therefore reducing the effort required in the presolve phase of some of these algorithms. To assess our results, we compare the impact of these improvements on the simplex method and two interior point methods (affine scaling and primal-dual) on randomly generated sets of desirable gambles that either avoid or do not avoid sure loss. We find that the simplex method is outperformed by the primal-dual and affine scaling methods, except for very small problems. We also find that using our starting feasible point and extra stopping criterion considerably improves the performance of the primal-dual and affine scaling methods.

Citation

Nakharutai, N., Troffaes, M. C., & Caiado, C. C. (2017). Efficient algorithms for checking avoiding sure loss. In A. Antonucci, G. Corani, I. Couso, & S. Destercke (Eds.), Proceedings of the Tenth International Symposium on Imprecise Probability : Theories and Applications, 10-14 July 2017, Lugano (Switzerland) (241-252)

Conference Name The Tenth International Symposium on Imprecise Probability: Theories and Applications (ISIPTA ’17)
Conference Location Lugano, Switzerland
Start Date Jul 10, 2017
End Date Jul 14, 2017
Acceptance Date Apr 17, 2017
Online Publication Date Jun 20, 2017
Publication Date Jun 20, 2017
Deposit Date Feb 17, 2017
Publicly Available Date Mar 29, 2024
Publisher PMLR
Pages 241-252
Series Title Proceedings of Machine Learning Research
Series Number 62
Series ISSN 1938-7228
Book Title Proceedings of the Tenth International Symposium on Imprecise Probability : Theories and Applications, 10-14 July 2017, Lugano (Switzerland).
Public URL https://durham-repository.worktribe.com/output/1147581
Publisher URL http://proceedings.mlr.press/v62/nakharutai17a.html

Files




You might also like



Downloadable Citations