The learnability of voting rules
نویسندگان
چکیده
Article history: Received 16 May 2008 Received in revised form 25 March 2009 Accepted 27 March 2009 Available online 9 April 2009
منابع مشابه
Learning Voting Trees
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. We show that, while in general a learning algorithm would require an exponential number of samples, if the number of leaves is polynomial in the size of the set of alternatives then a polynomial training set suffices. W...
متن کاملAutomated Design of Voting Rules by Learning from Examples
While impossibility results have established that no perfect voting rules exist, efficiently designing a voting rule that satisfies at least a given subset of desiderata remains a difficult task. We argue that such custom-built voting rules can be constructed by learning from examples. Specifically, we consider the learnability of the broad, concisely-representable class of scoring rules. Our m...
متن کاملOnline Judgment in the Context of International and National Rules: Ethical and Legal Challenges
Background: Online judgment is an economical and faster way than the judicial one. With the development of technology in recent decades, it has also been possible to make judgments online. Although few countries have incorporated this approach into their laws, online judgments are being developed and implemented in various areas such as international trade or intellectual property. The pres...
متن کاملLearnability of Heterogeneous Misspecification Equilibrium
This paper investigates the learnability of the equilibrium under adaptive learning with heterogeneous and misspecified models. Agents have imperfect and mutually different information sets of economic variables, so they form heterogeneous expectations under learning rules that are differently underparameterized. Under heterogeneous learning, the economy converges to a type of restricted percep...
متن کاملDouble voter perceptible blind signature based electronic voting protocol
Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 173 شماره
صفحات -
تاریخ انتشار 2009