Sciweavers

63 search results - page 13 / 13
» The computational complexity of nash equilibria in concisely...
Sort
View
AI
2006
Springer
13 years 5 months ago
Complexity of constructing solutions in the core based on synergies among coalitions
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
SIGECOM
2003
ACM
125views ECommerce» more  SIGECOM 2003»
13 years 10 months ago
Complexity of determining nonemptiness of the core
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
CP
2000
Springer
13 years 9 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao