<--- Back to Details
First PageDocument Content
Combinatorics / Greedy algorithm / Minimax / Regret / Preference / Borda count / Estimation theory / Maximum coverage problem / Mathematics / Decision theory / Discrete mathematics
Date: 2013-04-27 18:03:22
Combinatorics
Greedy algorithm
Minimax
Regret
Preference
Borda count
Estimation theory
Maximum coverage problem
Mathematics
Decision theory
Discrete mathematics

Multi-winner Social Choice with Incomplete Preferences Tyler Lu Craig Boutilier University of Toronto

Add to Reading List

Source URL: www.cs.toronto.edu

Download Document from Source Website

File Size: 488,70 KB

Share Document on Facebook

Similar Documents

Random tie-breaking in STV Jonathan Lundell  1

Random tie-breaking in STV Jonathan Lundell 1

DocID: 1m3Jg - View Document

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING  1 Consensus-based Ranking of Multi-valued Objects: A Generalized Borda Count Approach

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1 Consensus-based Ranking of Multi-valued Objects: A Generalized Borda Count Approach

DocID: 1aI95 - View Document

Institutions and Social Choice Theory Micro Theory II class notes, Temple University Dimitrios Diamantaras Department of Economics, Temple University http://astro.temple.edu/~dimitris

Institutions and Social Choice Theory Micro Theory II class notes, Temple University Dimitrios Diamantaras Department of Economics, Temple University http://astro.temple.edu/~dimitris

DocID: 17ze6 - View Document

General Assembly – 6th May, 2013 – Minutes Technical Chair: Jules van der Sneppen Technical Secretary: Hilde Woker 1. Opening General Assembly opens atThere aremembers present. 2. Approving Praesidiu

General Assembly – 6th May, 2013 – Minutes Technical Chair: Jules van der Sneppen Technical Secretary: Hilde Woker 1. Opening General Assembly opens atThere aremembers present. 2. Approving Praesidiu

DocID: 16tfi - View Document

PDF Document

DocID: 16nrG - View Document