Sciweavers

14 search results - page 3 / 3
» A note on stable sets, groups, and theories with NIP
Sort
View
EJC
2008
13 years 5 months ago
Fractional coloring and the odd Hadwiger's conjecture
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
Ken-ichi Kawarabayashi, Bruce A. Reed
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
CSCW
2002
ACM
13 years 5 months ago
NetWORKers and their Activity in Intensional Networks
Through ethnographic research, we document the rise of personal social networks in the workplace, which we call intensional networks. Paradoxically, we find that the most fundament...
Bonnie A. Nardi, Steve Whittaker, Heinrich Schwarz
SIGECOM
2003
ACM
125views ECommerce» more  SIGECOM 2003»
13 years 11 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