Computing optimal capacity allocations in network revenue management is computationally hard. The problem of computing exact Nash equilibria in non-zero-sum games is computationally hard, too. We present a fast heuristic that, in case it cannot converge to an exact Nash equilibrium, computes an...

The digital and information technology revolutions are based on algorithmic mathematics in many of their alternative forms. Algorithmic mathematics per se is not necessarily underpinned by the digital or the discrete only; analogue traditions of algorithmic mathematics have a noble pedigree,...

We propose an algorithm for computing "main stable sets" recently introduced by Ciardiello, Di Liddo (2009) on effectiveness form coalitional games modeled through a directed pseudograph. The algorithm is based upon a graph traversing method exploring extended paths minimal in coalitions and we...