Representation with Incomplete Votes

نویسندگان

چکیده

Platforms for online civic participation rely heavily on methods condensing thousands of comments into a relevant handful, based whether participants agree or disagree with them. These should guarantee fair representation the participants, as their outcomes may affect health conversation and inform impactful downstream decisions. To that end, we draw literature approval-based committee elections. Our setting is novel in approval votes are incomplete since will typically not vote all comments. We prove this complication renders non-adaptive algorithms impractical terms amount information they must gather. Therefore, develop an adaptive algorithm uses more efficiently by presenting incoming statements appear promising previous participants. method satisfies commonly used notions representation, even when only small fraction Finally, empirical evaluation using real data shows proposed provides representative practice.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Manipulation is Harder with Incomplete Votes

The Coalitional Manipulation (CM) problem has been studied extensively in the literature for many voting rules. The CM problem, however, has been studied only in the complete information setting, that is, when the manipulators know the votes of the non-manipulators. A more realistic scenario is an incomplete information setting where the manipulators do not know the exact votes of the nonmanipu...

متن کامل

On Representation and Querying Incomplete Information in Databases with Bags

We extend the approach to representation of partial information based on orderings on objects from sets to multisets. We characterize orderings arising under closed-and open-world assumptions and analyze their complexity. In contrast to the set case, where orderings are rst-order deenable and are thus expressible in standard database query languages, the orderings on bags are not expressible in...

متن کامل

Counting Votes with Formal Methods

Since the late 1990s voting in the Netherlands proceeds largely via voting machines. These are dedicated computers that record and store votes. These machines are under control of local governments, who put them up in voting stations on election days. These voting machines (and all new versions of them) have undergone independent evaluation before being admitted. However the internal mechanics ...

متن کامل

Representation of Belief Hierarchies in Games with Incomplete Information

We consider two partition models to be compatible if they render the same set of hierarchies of beliefs over a given set of underlying uncertainties. A model is reduced if only one partition element corresponds to each hierarchy. We show how to generate all models in a compatible class from the reduced model by introducing a state-dependent correlating mechanism which reveals different informat...

متن کامل

On Representation and Querying Incomplete Information in Databases with Multisets

We extend the approach to representation of partial information based on orderings on objects from sets to multisets. We characterize orderings arising under the closed-and the open-world assumptions and analyze their complexity. We prove that, in contrast to the set case, where orderings are rst-order deenable and are thus expressible in standard database query languages, the orderings on bags...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2023

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v37i5.25702