SearcharxivSearch

arXiv subjects

Srikanth B. Pai

Publications and source records attributed to Srikanth B. Pai.

3 recordsLinked to original sources

Single-Peakedness Does Not Prevent Leapfrogging under Abstention

Parties in spatial competition rarely choose platforms that reverse their ideological order. Mutual leapfrogging is the strongest form of reversal: each party locates beyond the other party's ideal point. In voting models without abstention single-peakedness rules out such reversals. We show that this conclusion does not survive endogenous abstention. There is a spatial voting model in which voter and party preferences are single-peaked, yet mutual leapfrogging occurs in pure-strategy equilibrium. The equilibrium survives because some deviations change which voters participate. We prove that such equilibria are impossible under a sufficient ordinal condition: parties agree on how to rank leftward and rightward deviations from their ideal points. The condition is general enough to cover symmetric single-peaked utilities and common translated utility shapes.

econ.TH

A Singleton Bound for Generalized Ferrers Diagram Rank Metric Codes

In this paper, we will employ the technique used in the proof of classical Singleton bound to derive upper bounds for rank metric codes and Ferrers diagram rank metric codes. These upper bounds yield the rank distance Singleton bound and an upper bound presented by Etzion and Silberstein respectively. Also we introduce generalized Ferrers diagram rank metric code which is a Ferrers diagram rank metric code where the underlying rank metric code is not necessarily linear. A new Singleton bound for generalized Ferrers diagram rank metric code is obtained using our technique.

cs.IT

A Singleton Bound for Lattice Schemes

In this paper, we derive a Singleton bound for lattice schemes and obtain Singleton bounds known for binary codes and subspace codes as special cases. It is shown that the modular structure affects the strength of the Singleton bound. We also obtain a new upper bound on the code size for non-constant dimension codes. The plots of this bound along with plots of the code sizes of known non-constant dimension codes in the literature reveal that our bound is tight for certain parameters of the code.

cs.IT