Motivation The minimizers scheme is a method for selecting k -mers from sequences. It is used in many bioinformatics software tools to bin comparable sequences or to sample a sequence in a deterministic fashion at approximately regular intervals, in order to reduce memory consumption and processing time. Although very useful, the minimizers selection procedure has undesirable behaviors (e.g. to...

We present a complete method for synthesizing lexicographic linear ranking functions supported by inductive linear invariants for loops with linear guards and transitions. Proving termination via linear ranking functions often requires invariants; yet invariant generation is expensive. Thus, we describe a technique that discovers just the invariants necessary for proving termination. Finally, w...

This article offers a brief comparative look at American and British jurisprudential pending selection reforms, and argues that American states could improve their appointive systems by incorporating modern personnel recruitment and hiring practices. To restore public confidence in the courts, people must believe that judges exercise legitimate authority, undistorted by personal or partisan pre...

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...

This paper models collective decision-making scenarios by using a priority-based aggregation procedure, the so-called lexicographic method, in order to represent a form of reliability-based ‘deliberation’. More precisely, it considers agents with a preference ordering over a set of objects and a reliability ordering over the agents themselves, providing a logical framework describing the way in...

The objective of this paper is to develop matrix games with pay-offs of triangular hesitant fuzzy elements (THFEs). To solve such games, a new methodology has been derived based on the notion of weighted average operator and score function of THFEs. Firstly, we formulate two non-linear programming problems with THFEs. Then applying the score function of THFEs, we transform these two problems in...

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...