We develop a criterion for coalition formation among goal-directed agents, the indecomposable do-ut-des property. The indecomposable do-ut-des property refines the do-ut-des proper...
Guido Boella, Luigi Sauro, Leendert W. N. van der ...
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
We study sequent calculi for propositional modal logics, interpreted over coalgebras, with admissibility of cut being the main result. As applications we present a new proof of th...
Emerging high speed networks will carry tra c for services such as video-on-demand and video teleconferencing that require resource reservation along the path on which the tra c i...
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...