Algorithmics, Social choice, Market Design, and Other Topics

The COMSOC 2010 program is up . PAMAS has a decent showing with four papers: On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions Felix Brandt, Markus Brill, and Hans Georg Seedig Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates Felix Brandt, Markus Brill, Edith Hemaspaandra, and Lane A. Hemaspaandra Optimal Partitions in Additively Separable Hedonic Games Haris Aziz, Felix Brandt, and Hans Georg Seedig Group-Strategyproof Irresolute Social Choice Functions Felix Brandt 

The NYT looks at how the web may be changing the dynamics of how academic work is reviewed.