We propose a theory of strategic voting in multi-winner elections with approval balloting: A fixed number  of candidates are to be elected; each voter votes for as many candidates as she wants; the  candidates with the most votes are elected. We assume that voter preferences are separable and that there exists a tiny probability that any vote might be misrecorded. Best responses involve votin...

In “The Logic of Campaigning”, Dean and Parikh consider a candidate making campaign statements to appeal to the voters. They model these statements as Boolean formulas over variables that represent stances on the issues, and study optimal candidate strategies under three proposed models of voter preferences based on the assignments that satisfy these formulas. We prove that voter utility evalua...

The paper analyzes under what conditions spiteful preferences are evolutionarily stable applying the indirect evolution approach. With a quadratic material payo¤ function, spiteful preferences are evolutionarily stable for a large set of parameters. It is shown that strategic substitutability or complementarity is endogenous property of the game played with evolutionarily stable preferences. It...

V -order is a global order on strings related to Unique Maximal Factorization Families (UMFFs) [6,7], which are themselves generalizations of Lyndon words [14]. V -order has recently been proposed as an alternative to lexicographical order in the computation of suffix arrays and in the suffix-sorting induced by the Burrows-Wheeler transform. Efficient V -ordering of strings thus becomes a matte...

We study the evolutionary selection of conjectures in duopoly games when players have other regarding preferences, i.e. preferences over payoff distributions. In both the Cournot and Bertrand duopoly games, the consistent conjectures are independent of other regarding preferences. Both duopoly games have evolutionarily stable conjectures that depend on other regarding preferences but that do no...

A chance-constraint multi-objective model under uncertainty in the availability of subassemblies is proposed for scheduling in ATO systems. The on-time delivery of customer orders as well as reducing the company's cost is crucial; therefore, a three-objective model is proposed including the minimization of1) overtime, idletime, change-over, and setup costs, 2) total dispersion of items’ deliver...

Lexicographic product G◦H of two graphs G and H has vertex set V (G)×V (H) and two vertices (u1, v1) and (u2, v2) are adjacent whenever u1u2 ∈ E(G), or u1 = u2 and v1v2 ∈ E(H). If every matching of G of size k can be extended to a perfect matching in G, then G is called k-extendable. In this paper, we study matching extendability in lexicographic product of graphs. The main result is that the l...

Helly’s theorem says that if every d + 1 elements of a given finite set of convex objects in R have a common point, then there is a point common to all of the objects in the set. We define three new types of Helly theorems: discrete Helly theorems—where the common point should belong to an a-priori given set, lexicographic Helly theorems—where the common point should not be lexicographically gr...

Lexicographic derivatives developed by Nesterov and directed subdifferentials developed by Baier, Farkhi, and Roshchina are both essentially nonconvex generalized derivatives for nonsmooth nonconvex functions and satisfy strict calculus rules and mean-value theorems. This article aims to clarify the relationship between the two generalized derivatives. In particular, for scalar-valued functions...

In this paper, we introduce the notion of Pythagorean Anti fuzzy graph. We then define Cartesian product and Lexicographic on It is proved that two graphs graph general, lexicographic regular need not be Necessary sufficient conditions for to are determined. Further, concept isomorphism with suitable example.