[Publicity-list] DIMACS Tutorial on Social Choice and Computer Science
Linda Casals
lindac at dimacs.rutgers.edu
Mon Apr 5 15:20:17 EDT 2004
*************************************************
DIMACS Tutorial on Social Choice and Computer Science
May 10 - 14, 2004
DIMACS Center, Rutgers University, Piscataway, NJ
Organizers:
Kevin Chang, University of Illinois, kcchang at cs.uiuc.edu
Michel Regenwetter, University of Illinois, regenwet at uiuc.edu
Presented under the auspices of the Special Focus on Computation and
the Socio-Economic Sciences.
************************************************
The theory of social choice and voting has had a long history in the
social sciences, dating back to early work of Condorcet and others in
the 18th century. Some modern issues facing the theory of social
choice relate heavily to computer science. Often we need to determine
preferences for an individual or group, while maintaining accuracy,
fairness and security, sometimes with only limited information and/or
computational power. This tutorial will consider computer science and
social science issues in insuring the best choices given limited
information and computation. It will build on early work on
computational complexity of computing the winner of an election in.
Moreover, we are also seeing voting/social choice
issues arising in strictly computer science applications such as
database and information retrieval, Internet search and meta-search,
and collaborative filtering. The tutorial will also consider such
applications. The tutorial will present an introduction to the
concepts and models of individual preference or utility as well as
social choice theory and introduce participants to a variety of modern
computational issues and computer science applications.
The following is a tentative list of topics:
* Introduction to Voting Theory: History and Procedures.
* Computational Complexity of Social Choice Procedures.
* Mathematical Representations of Preference and Utility.
* Ranking and Preference in Computer Science: Models and Semantics.
* Rank-based Top-k Query Algorithms in Database Search.
* Voting and Security: An introduction to the use of
error-resilient, waitless methods of voting analysis.
* Collaborative Filtering in Information Retrieval.
* Internet Search and Meta-Search.
* Behavioral Social Choice Theory.
* Voting over the Internet.
**************************************************************
Participation:
Talks for this workshop are by invitation only.
**************************************************************
Workshop Program:
Monday, May 10, 2004
8:15 - 8:45 Registration and Breakfast
8:45 - 9:00 Welcome and Opening Remarks
Fred Roberts, DIMACS Director
Kevin Chang and Michel Regenwetter, Organizers
9:00 - 9:50 Introduction to Voting Theory: History and Procedures
Arnold Urken, Stevens Institute of Technology
9:50 - 10:05 Break
10:05 - 10:55 Introduction to Voting Theory: History and Procedures (continued)
Arnold Urken, Stevens Institute of Technology
10:55 - 11:10 Break
11:10 - 12:00 Introduction to Voting Theory: History and Procedures (continued)
Arnold Urken, Stevens Institute of Technology
12:00 - 1:30 Lunch - DIMACS Lounge
1:30 - 2:20 Mathematical Representations of Preference and Utility
Michel Regenwetter, University of Illinois at Urbana-Champaign
2:20 - 2:35 Break
2:35 - 3:25 Mathematical Representations of Preference and Utility (continued)
Michel Regenwetter, University of Illinois at Urbana-Champaign
3:25 - 3:40 Break
3:40 - 4:30 Mathematical Representations of Preference and Utility (continued)
Michel Regenwetter, University of Illinois at Urbana-Champaign
Tuesday, May 11, 2004
8:30 - 9:00 Registration and Breakfast
9:00 - 9:50 Voting and Security
Arnold Urken, Stevens Institute of Technology
9:50 - 10:05 Break
10:05 - 10:55 Voting and Security (continued)
Arnold Urken, Stevens Institute of Technology
10:55 - 11:10 Break
11:10 - 12:00 Voting and Security (continued)
Arnold Urken, Stevens Institute of Technology
12:00 - 1:30 Lunch - DIMACS Lounge
1:30 - 2:20 Computational Complexity of Social Choice Procedures
Craig Tovey, Georgia Institute of Technology
2:20 - 2:35 Break
2:35 - 3:25 Computational Complexity of Social Choice Procedures (continued)
Craig Tovey, Georgia Institute of Technology
3:25 - 3:40 Break
3:40 - 4:30 Computational Complexity of Social Choice Procedures (continued)
Craig Tovey, Georgia Institute of Technology
Wednesday, May 12, 2004
8:30 - 9:00 Registration and Breakfast
9:00 - 9:50 Ranking and Preference in Computer Science: Models and Semantics
Kevin Chang, University of Illinois at Urbana-Champaign
9:50 - 10:05 Break
10:05 - 10:55 Ranking and Preference in Computer Science: Models and Semantics (continued)
Kevin Chang, University of Illinois at Urbana-Champaign
10:55 - 11:10 Break
11:10 - 12:00 Ranking and Preference in Computer Science: Models and Semantics (continued)
Kevin Chang, University of Illinois at Urbana-Champaign
12:00 - 1:30 Lunch - DIMACS Lounge
1:30 - 2:20 Behavioral Social Choice Theory
Michel Regenwetter, University of Illinois at Urbana-Champaign
2:20 - 2:35 Break
2:35 - 3:25 Behavioral Social Choice Theory (continued)
Michel Regenwetter, University of Illinois at Urbana-Champaign
3:25 - 3:40 Break
3:40 - 4:30 Behavioral Social Choice Theory (continued)
Michel Regenwetter, University of Illinois at Urbana-Champaign
Thursday, May 13, 2004
8:30 - 9:00 Registration and Breakfast
9:00 - 9:50 Collaborative Filtering in Information Retrieval
William Cohen, Carnegie Mellon University
9:50 - 10:05 Break
10:05 - 10:55 Collaborative Filtering in Information Retrieval (continued)
William Cohen, Carnegie Mellon University
10:55 - 11:10 Break
11:10 - 12:00 Collaborative Filtering in Information Retrieval (continued)
William Cohen, Carnegie Mellon University
12:00 - 1:30 Lunch - DIMACS Lounge
1:30 - 2:20 Rank-based Top-k Query Algorithms in Database Search
Kevin Chang, University of Illinois at Urbana-Champaign
2:20 - 2:35 Break
2:35 - 3:25 Rank-based Top-k Query Algorithms in Database Search (continued)
Kevin Chang, University of Illinois at Urbana-Champaign
3:25 - 3:40 Break
3:40 - 4:30 Rank-based Top-k Query Algorithms in Database Search (continued)
Kevin Chang, University of Illinois at Urbana-Champaign
4:30 - 5:30 Wine and Cheese - DIMACS Lounge
Friday, May 14, 2004
9:00 - 9:50 Internet Search and Meta-Search
Ravi Kumar, IBM Almaden Research Center
9:50 - 10:05 Break
10:05 - 10:55 Internet Search and Meta-Search (continued)
Ravi Kumar, IBM Almaden Research Center
10:55 - 11:10 Break
11:10 - 12:00 Internet Search and Meta-Search (continued)
Ravi Kumar, IBM Almaden Research Center
12:00 - 1:30 Lunch - DIMACS Lounge
1:30 - 2:20 Voting over the Internet
Ted Selker, Massachusetts Institute of Technology
2:20 - 2:35 Break
2:35 - 3:25 Voting over the Internet (continued)
Ted Selker, Massachusetts Institute of Technology
3:25 - 3:40 Break
3:40 - 4:30 Voting over the Internet (continued)
Ted Selker, Massachusetts Institute of Technology
**************************************************************
Registration Fees:
(Pre-registration deadline: May 3, 2004)
Please see website for additional registration information.
*********************************************************************
Information on participation, registration, accomodations, and travel
can be found at:
http://dimacs.rutgers.edu/Workshops/SocialChoice/
**PLEASE BE SURE TO PRE-REGISTER EARLY**
*******************************************************************
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo at metzdowd.com
More information about the cryptography
mailing list