相关论文: The physics of custody

We consider a discrete set of individual agents interacting with a continuum. Examples might be a predator facing a huge group of preys, or a few shepherd dogs driving a herd of sheeps. Analytically, these situations can be described…

The K-way vertex cut problem} consists in, given a graph G, finding a subset of vertices of a given size, whose removal partitions G into the maximum number of connected components. This problem has many applications in several areas. It…

We study the computational complexity of controlling the result of an election by breaking ties strategically. This problem is equivalent to the problem of deciding the winner of an election under parallel universes tie-breaking. When the…

We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier results both on the side of parameterized hardness as well…

A law in a multiagent system is a set of constraints imposed on agents' behaviours to avoid undesirable outcomes. The paper considers two types of laws: useful laws that, if followed, completely eliminate the undesirable outcomes and…

Population dynamic of getting divorced depends on many global factors, including social norms, economy, law or demographics as well as individual factors like the level of interpersonal or problem-solving skills of the spouses. We sought to…

Many-body systems, such as electrons flowing in a superconductor, are among the most difficult theoretical problems to study. A new family of exactly solvable models may offer some answers.

We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and Graph Theory. In these setups, the paths of photons are identified such that the photon-source information is never created.…

Two-sided popular matchings in bipartite graphs are a well-known generalization of stable matchings in the marriage setting, and they are especially relevant when preference lists are incomplete. In this case, the cardinality of a stable…

Starting from the linearized BdG-equation we make the simple observation that pairing can occur between particles with total momenta different from zero, e.g., with equal momentum and opposite spin, in cases of an effective interaction…

The maximum clique problem is a classical NP-complete problem in graph theory and has important applications in many domains. In this paper we show, in a partially non-constructive way, the existence of an exact polynomial-time algorithm…

In this paper we study the long-standing open question regarding the computational complexity of one of the core problems in supply chains management, the periodic joint replenishment problem. This problem has received a lot of attention…

The objective of this article is to formalize the definition of NP problems. We construct a mathematical model of discrete problems as independence systems with weighted elements. We introduce two auxiliary sets that characterize the…

We consider the problem of choosing Euclidean points to maximize the sum of their weighted pairwise distances, when each point is constrained to a ball centered at the origin. We derive a dual minimization problem and show strong duality…

The entangled states that include every physical properties of particles would be important for both theoretical and applied physics. However, the existence and properties of such entangled states are unclear at present. Here we…

We study stable matching problems with locality of information and control. In our model, each agent is a node in a fixed network and strives to be matched to another agent. An agent has a complete preference list over all other agents it…

We investigate a variety of problems of finding tours and cycle covers with minimum turn cost. Questions of this type have been studied in the past, with complexity and approximation results as well as open problems dating back to work by…

Different steps leading to the new functional for pairing based on natural orbitals and occupancies proposed in ref. [D. Lacroix and G. Hupin, arXiv:1003.2860] are carefully analyzed. Properties of quasi-particle states projected onto good…

Garside-theoretical solutions to the conjugacy problem in braid groups depend on the determination of a characteristic subset of the conjugacy class of any given braid, e.g. the sliding circuit set. It is conjectured that, among rigid…

The Stable Roommates problem involves matching a set of agents into pairs based on the agents' strict ordinal preference lists. The matching must be stable, meaning that no two agents strictly prefer each other to their assigned partners. A…