相关论文: Recognizing Linked Domain in Polynomial Time

A simple mathematical model is proposed to study the effect of the average trend of a population on the opinion of each individual, when a group decision has to be made by voting. It is shown that if such effect is strong enough a…

We consider a committee voting setting in which each voter approves of a subset of candidates and based on the approvals, a target number of candidates are to be selected. In particular we focus on the axiomatic property called extended…

Mechanism design is concerned with settings where a policymaker (or social planner) faces the problem of aggregating the announced preferences of multiple agents into a collective (or social), system-wide decision. One of the most important…

In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…

Representing time is crucial for cyber-physical systems and has been studied extensively in the Situation Calculus. The most commonly used approach represents time by adding a real-valued fluent $\mathit{time}(a)$ that attaches a time point…

A function g, with domain the natural numbers, is a quasi-polynomial if there exists a period m and polynomials p_0,p_1,...,p_{m-1} such that g(t)=p_i(t) for t=i mod m. Quasi-polynomials classically -- and "reasonably" -- appear in Ehrhart…

In this Letter we extend the proof, by Faraco and Lindberg, of Taylor's conjecture in multiply connected domains to cover arbitrary vector potentials and remove the need to impose conditions on the magnetic field due to gauge invariance.…

Several rules for social choice are examined from a unifying point of view that looks at them as procedures for revising a system of degrees of belief in accordance with certain specified logical constraints. Belief is here a social…

Problems with majority voting over pairs as represented by Arrow's Theoremand those of finding the lengths of closed paths as captured by the Traveling Salesperson Problem (TSP) appear to have nothing in common. In fact, they are connected.…

Condorcet domains are subsets of permutations arising in voting theory: regarding their permutations as preference orders on a list of candidates, one avoids Condorcet's paradox when aggregating the preferences via a simple majority…

We consider a group of voters that needs to decide between two candidates. We propose a novel family of neutral and strategy-proof rules, which we call sequential unanimity rules. By demonstrating their formal equivalence to the M-winning…

Election results are determined by numerous social factors that affect the formation of opinion of the voters, including the network of interactions between them and the dynamics of opinion influence. In this work we study the result of…

A time dependent generalization of the Ginzburg -Landau Lagrangian is proposed. It contains two terms determining the time dependence and the four arbitrary scalar functions. Relevant equations, which coincide with equations following from…

Two subsets of a given set are path-disconnected if they lie in different connected components of the larger set. Verification of path-disconnectedness is essential in proving the infeasibility of motion planning and trajectory optimization…

Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…

We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets of objects. The key question in this area, which has important…

Two characterizations of the whole class of strategy-proof aggregation rules on rich domains of locally unimodal preorders in finite median join-semilattices are provided. In particular, it is shown that such a class consists precisely of…

We consider the concept of a local set of inference rules. A local rule set can be automatically transformed into a rule set for which bottom-up evaluation terminates in polynomial time. The local-rule-set transformation gives…

We consider a voting model, where a number of candidates need to be selected subject to certain feasibility constraints. The model generalises committee elections (where there is a single constraint on the number of candidates that need to…

We consider distributed systems with an arbitrary number of processes, modelled by timed automata that communicate through location guards: a process can take a guarded transition if at least one other process is in a given location. In…