Monday, 21 Jan 2013

08:45am - 09:00am

Registration

09:00am - 10:30am

Judgment aggregation I
Ulle Endriss, University of Amsterdam, The Netherlands

10:30am - 11:00am

--- Group Photo & Coffee Break ---

11:00am - 12:00nn

Judgment aggregation II
Ulle Endriss, University of Amsterdam, The Netherlands

12:00nn - 01:30pm

--- Lunch ---

01:30pm - 02:30pm

Simple games and secret sharing schemes I
Arkadii Slinko, University of Auckland, New Zealand

02:30pm - 02:45pm

--- Break ---

02:45pm - 03:15pm

Simple games and secret sharing schemes II
Arkadii Slinko, University of Auckland, New Zealand

03:15pm - 03:45pm

Simple games and secret sharing schemes III
Arkadii Slinko, University of Auckland, New Zealand

03:45pm - 04:15pm

--- Coffee Break ---

04:15pm - 04:45pm

Simple games and secret sharing schemes IV
Arkadii Slinko, University of Auckland, New Zealand

Tuesday, 22 Jan 2013

08:45am - 09:00am

Registration

09:00am - 10:30am

Revealed preferences and group decisions: lessons from modern decision theory I
Andrei Gomberg, Instituto Tecnológico Autónomo de México, Mexico

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

Revealed preferences and group decisions: lessons from modern decision theory II
Andrei Gomberg, Instituto Tecnológico Autónomo de México, Mexico

12:00nn - 01:30pm

--- Lunch ---

01:30pm - 02:30pm

Voting in combinatorial domains: seven ways to proceed
Jerome Lang, Centre National de la Recherche Scientifique and Université Paris Dauphine, France

02:30pm - 02:45pm

--- Break ---

02:45pm - 03:15pm

On the tradeoff between economic efficiency and strategyproofness in randomized social choice
Haris Aziz, NICTA, Australia

03:15pm - 03:45pm

Taxation and stability in cooperative games
Yair Zick, Nanyang Technological University

03:45pm - 04:15pm

--- Coffee Break ---

04:15pm - 04:45pm

Decentralized protocols for division of indivisible goods
Toby Walsh, NICTA and University of New South Wales, Australia

04:45pm - 05:15pm

Restricted manipulation in iterative voting
Umberto Grandi, University of Padova, Italy

Wednesday, 23 Jan 2013

08:45am - 09:00am

Registration

09:00am - 10:30am

Computational complexity of computing strategic votes I
Toby Walsh, NICTA and University of New South Wales, Australia

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

Computational complexity of computing strategic votes I
Toby Walsh, NICTA and University of New South Wales, Australia

12:00nn - 01:30pm

--- Lunch Reception at IMS ---

01:30pm - 02:30pm

Economic inequality and computational complexity
Ulle Endriss, University of Amsterdam, The Netherlands

02:30pm - 02:45pm

--- Break ---

02:45pm - 03:15pm

The complexity of election winner prediction
Piotr Faliszewski, AGH University of Science and Technology, Poland

03:15pm - 03:45pm

Nonconvergent electoral equilibria under scoring rules: beyond plurality
Arkadii Slinko, University of Auckland, New Zealand

03:45pm - 04:15pm

--- Coffee Break ---

04:15pm - 04:45pm

Optimal proportional cake cutting with connected pieces
Biaoshuai Tao, Nanyang Technological University

04:45pm - 05:15pm

Strategic voting and the logic of knowledge
Abdallah Saffidine, Université Paris-Dauphine, France

Thursday, 24 Jan 2013

08:45am - 09:00am

Registration

09:00am - 10:30am

The algorithms and complexity results for multiwinner elections I
Piotr Faliszewski, AGH University of Science and Technology, Poland

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

The algorithms and complexity results for multiwinner elections II
Piotr Faliszewski, AGH University of Science and Technology, Poland

12:00nn - 01:30pm

--- Lunch ---

01:30pm - 02:30pm

Vote revelation: empirical characterization of scoring rules (PDF)
Andrei Gomberg, Instituto Tecnológico Autónomo de México, Mexico

02:30pm - 02:45pm

--- Break ---

02:45pm - 03:15pm

TBA
Edith Elkind, Nanyang Technological University

03:15pm - 03:45pm

Empirical analysis of voting rules and large datasets
Nicholas Mattei, NICTA, Australia

03:45pm - 04:15pm

--- Coffee Break ---

04:15pm - 04:45pm

Open problem session

Friday, 25 Jan 2013

08:45am - 09:00am

Registration

09:00am - 10:30am

Graphical languages for preference representation and applications I
Jerome Lang, Centre National de la Recherche Scientifique and Université Paris Dauphine, France

10:30am - 11:00am

--- Coffee Break ---

11:00am - 12:00nn

Graphical languages for preference representation and applications II
Jerome Lang, Centre National de la Recherche Scientifique and Université Paris Dauphine, France