Sharp Thresholds for Monotone Non Boolean Functions and Social Choice Theory

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

A key fact in the theory of Boolean functions $f : \{0,1\}^n \to \{0,1\}$ is that they often undergo sharp thresholds. For example: if the function $f : \{0,1\}^n \to \{0,1\}$ is monotone and symmetric under a transitive action with $\E_p[f] = \eps$ and $\E_q[f] = 1-\eps$ then $q-p \to 0$ as $n \to \infty$. Here $\E_p$ denotes the product probability measure on $\{0,1\}^n$ where each coordinate takes the value $1$ independently with probability $p$. The fact that symmetric functions undergo sharp thresholds is important in the study of random graphs and constraint satisfaction problems as well as in social choice.In this paper we prove sharp thresholds for monotone functions taking values in an arbitrary finite sets. We also provide examples of applications of the results to social choice and to random graph problems. Among the applications is an analog for Condorcet's jury theorem and an indeterminacy result for a large class of social choice functions.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Sharp Thresholds for Monotone Non Boolean Functions and Social Choice Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sharp Thresholds for Monotone Non Boolean Functions and Social Choice Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sharp Thresholds for Monotone Non Boolean Functions and Social Choice Theory will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-463299

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.