We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under...

Theoretical and experimental studies of noncooperative games increasingly recognize Nash equilibrium as a limiting outcome of players' repeated interaction. This note, while sharing that view, illustrates and advocates combined use of convex optimization and differential equations, the purpose...

Theoretical and experimental studies of noncooperative games increasingly recognize Nash equilibrium as a limiting outcome of players' repeated interaction. This note, while sharing that view, illustrates and advocates combined use of convex optimization and differential equations, the purpose...