On the linear structure of betting criterion and the checking of coherence

We use imprecise probabilities, based on a concept of generalized coherence, for the management of uncertainty in artificial intelligence. With the aim of reducing the computational difficulties, in the checking of generalized coherence we propose a method which exploits, in the framework of the betting criterion, suitable subsets of the sets of values of the random gains. We give an algorithm in each step of which a linear system with a reduced number of unknowns can be used. Our method improves a procedure already existing in literature and could be integrated with recent approaches of other authors, who exploit suitable logical conditions with the aim of splitting the problem into subproblems. We remark that our approach could be also used in combination with efficient methods like column generation techniques. Finally, to illustrate our method, we give some examples