SearcharxivSearch

arXiv subjects

Srikanth Pai

Publications and source records attributed to Srikanth Pai.

2 recordsLinked to original sources

When Does Party Convergence Persist under Alienation-Based Abstention?

In the standard Downsian model, two office-seeking parties converge to the median voter. However alienated voters may abstain and turn out only for a party within their tolerance radius. For single-peaked voter distributions, convergence survives but relocates to a central voter, the median of the electorate that participates at the convergent platform. However single-peakedness of the voter distribution is an empirically contested assumption. So we first characterize pure-strategy equilibrium for any continuous voter distribution. For general distributions, pure-strategy equilibrium can fail to exist or be non-unique, and existence of equilibrium need not persist as the tolerance radius of the voters increases. In order to resolve these issues, we propose a fundamental object: \emph{centripetal} structure for which there is a single anchor platform toward which competition always pulls. We show this structure produces convergence at equilibrium under alienation based abstention. Our main result concerns the emergence and persistence of this new structure as the tolerance radius increases. Even though equilibria for office-seeking parties themselves can vanish and reappear as the radius grows, once centripetal structure emerges, it persists as long as the midpoint voter is not alienated. Moreover, the centripetal structure always emerges, and this structure classifies equilibrium completely when parties are policy motivated.

econ.TH

On the Bounds of Certain Maximal Linear Codes in a Projective Space

The set of all subspaces of $\mathbb{F}_q^n$ is denoted by $\mathbb{P}_q(n)$. The subspace distance $d_S(X,Y) = \dim(X)+ \dim(Y) - 2\dim(X \cap Y)$ defined on $\mathbb{P}_q(n)$ turns it into a natural coding space for error correction in random network coding. A subset of $\mathbb{P}_q(n)$ is called a code and the subspaces that belong to the code are called codewords. Motivated by classical coding theory, a linear coding structure can be imposed on a subset of $\mathbb{P}_q(n)$. Braun, Etzion and Vardy conjectured that the largest cardinality of a linear code, that contains $\mathbb{F}_q^n$, is $2^n$. In this paper, we prove this conjecture and characterize the maximal linear codes that contain $\mathbb{F}_q^n$.

cs.IT