Sciweavers

12 search results - page 1 / 3
» Strengthening Admissible Coalitions
Sort
View
ECAI
2006
Springer
14 years 23 days ago
Strengthening Admissible Coalitions
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 ...
ECAI
2010
Springer
13 years 12 months ago
Strengthening Landmark Heuristics via Hitting Sets
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...
Blai Bonet, Malte Helmert
ENTCS
2008
126views more  ENTCS 2008»
13 years 11 months ago
Admissibility of Cut in Coalgebraic Logics
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...
Dirk Pattinson, Lutz Schröder
SODA
1996
ACM
157views Algorithms» more  SODA 1996»
14 years 3 days ago
Routing and Admission Control in General Topology Networks with Poisson Arrivals
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...
Anil Kamath, Omri Palmon, Serge A. Plotkin
ATAL
2007
Springer
14 years 5 months ago
Average-case tractability of manipulation in voting via the fraction of manipulators
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...
Ariel D. Procaccia, Jeffrey S. Rosenschein