Comparing preference orders: Asymptotic independence

نویسندگان

چکیده

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

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

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

منابع مشابه

Comparing preference orders: Asymptotic independence

A decision maker is presented with two preference orders over n objects and chooses the one which is “closer” to his own preference order. We consider several plausible comparison rules that the decision maker might employ. We show that when n is large and the pair of orders to be compared randomly realizes, different comparison rules lead to statistically almost independent choices. Thus, two ...

متن کامل

Consistently Adding Amalgamations to Preference Orders

The use of user preferences for database retrieval promises a high degree of personalization by cooperatively combating the information flood. But most of the time preferences are only given for a subset of the available domain values and thus can still lead to unmanageable result sets especially in the presence of many attributes in a query. To limit such result sets preferences need to be com...

متن کامل

On Discovering Bucket Orders from Preference Data

The problem of ordering a set of entities which contain inherent ties among them arises in many applications. Notion of “bucket order” has emerged as a popular mechanism of ranking in such settings. A bucket order is an ordered partition of the set of entities into “buckets”. There is a total order on the buckets, but the entities within a bucket are treated as tied. In this paper, we focus on ...

متن کامل

Privacy in Elections: k-Anonymizing Preference Orders

We study the (parameterized) complexity of a combinatorial problem, motivated by the desire to publish elections-related data, while preserving the privacy of the voters (humans or agents). In this problem, introduced and defined here, we are given an election, a voting rule, and a distance function over elections. The task is to find an election which is not too far away from the original elec...

متن کامل

All orders asymptotic expansion of large partitions

The generating function which counts partitions with the Plancherel measure (and its q-deformed version), can be rewritten as a matrix integral, which allows to compute its asymptotic expansion to all orders. There are applications in statistical physics of growing/melting crystals, T.A.S.E.P., and also in algebraic geometry. In particular we compute the Gromov-Witten invariants of the Xp = O(p...

متن کامل

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


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

ژورنال

عنوان ژورنال: Mathematical Social Sciences

سال: 2016

ISSN: 0165-4896

DOI: 10.1016/j.mathsocsci.2015.10.005