Generalized Distance Bribery

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Swap Bribery

In voting theory, bribery is a form of manipulative behavior in which an external actor (the briber) offers to pay the voters to change their votes in order to get her preferred candidate elected. We investigate a model of bribery where the price of each vote depends on the amount of change that the voter is asked to implement. Specifically, in our model the briber can change a voter’s preferen...

متن کامل

A generalized evidence distance

Dempster-Shafer theory of evidence (D-S theory) is widely used in uncertain information process. The basic probability assignment(BPA) is a key element in D-S theory. How to measure the distance between two BPAs is an open issue. In this paper, a new method to measure the distance of two BPAs is proposed. The proposed method is a generalized of existing evidence distance. Numerical examples are...

متن کامل

Generalized minimum distance functions

We study the r-th generalized minimum distance function (gmd function for short) and the corresponding generalized footprint function of a graded ideal in a polynomial ring over a field. If X is a set of projective points over a finite field and I(X) is its vanishing ideal, we show that the gmd function and the Vasconcelos function of I(X) are equal to the r-th generalized Hamming weight of the...

متن کامل

Generalized Distance Functions

In this paper, we obtain a generalized version of the wellknown distance function family Lp norm. We prove that the new functions satisfy distance function properties. By using these functions, convex symmetric shapes can be described as loci, the set of points which are in equal distance from a given point. We also show that these symmetric convex shapes can be easily parameterized. We also sh...

متن کامل

Nonuniform bribery

We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we request. Our model is an extension of the one of Faliszewski et al. [FHH06], where each voter has a single price for any change we may ask for. We show polynomial-time algorithms for our version of bribery for a broad range ...

متن کامل

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


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

ژورنال

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

سال: 2019

ISSN: 2374-3468,2159-5399

DOI: 10.1609/aaai.v33i01.33011764