Posts

Showing posts from April 19, 2009

Encyclopedia of Algorithms

I have reviewed the newly published Encyclopedia of Algorithms . This is a commendable effort by the editor with 300 entries on central algorithmic problems and over 4,000 additional references.

Interesting group

Mathematical and computational social sciences is growing (see this journal for instance). I just noticed a research group by the same name in Auckland. I could recognize at least one name : Prof. Arkadii Slinko . Check out the group from this link .

Power indices of spanning connectivity games

Image
In AAIM 2009 conference which is being held in San Francisco, one of my co-authors will be presenting our paper in the game theory session. The title of the paper is "Power indices of spanning connectivity games" and is joint work with O. Lachish, M. Paterson and R. Savani. We consider a simple coalitional game called the spanning connectivity game (SCG) based on an undirected, unweighted multigraph, where edges are players. We examine the computational Complexity of computing the voting power indices of edges in the SCG.