Related papers: River Crossing Problems: Algebraic Approach
We study a simple exchange market, introduced by Gourv\'{e}s, Lesca and Wilczynski (IJCAI-17), where every agent initially holds a single object. The agents have preferences over the objects, and two agents may swap their objects if they…
The ways in which natural selection can allow the proliferation of cooperative behavior have long been seen as a central problem in evolutionary biology. Most of the literature has focused on interactions between pairs of individuals and on…
In this paper, we explore cooperative and competitive coupled obstacle systems, which, up to now, are new type obstacle systems and formed by coupling two equations belonging to classical obstacle problem. On one hand, applying the…
Consider a transportation problem with sets of sources and sinks. There are profits and prices on the edges. The goal is to maximize the profit while meeting the following constraints; the total flow going out of a source must not exceed…
The multiple knapsack problem with grouped items aims to maximize rewards by assigning groups of items among multiple knapsacks, considering knapsack capacities. Either all items in a group are assigned or none at all. We propose algorithms…
Decision problems are problems of the following nature: given a property P and an object O, find out whether or not the object O has the property P. On the other hand, witness problems are: given a property P and an object O with the…
Social discrimination seems to be a persistent phenomenon in many cultures. It is important to understand the mechanisms that lead people to judge others by the group to which they belong, rather than individual qualities. It was recently…
How do groups of individuals achieve consensus in movement decisions? Do individuals follow their friends, the one predetermined leader, or whomever just happens to be nearby? To address these questions computationally, we formalize…
Explaining the evolution of cooperation in the strong altruism scenario, where a cooperator does not benefit from her contribution to the public goods, is a challenging problem that requires positive assortment among cooperators (i.e.,…
When the competing classes in a classification problem are not of comparable size, many popular classifiers exhibit a bias towards larger classes, and the nearest neighbor classifier is no exception. To take care of this problem, we develop…
Synchronization, cooperation, and chaos are ubiquitous phenomena in nature. In a population composed of many distinct groups of individuals playing the prisoner's dilemma game, there exists a migration dilemma: No cooperator would migrate…
A transitive permutation group is semiprimitive if each of its normal subgroups is transitive or semiregular. Interest in this class of groups is motivated by two sources: problems arising in universal algebra related to collapsing monoids…
The chore division problem simulates the fair division of a heterogeneous, undesirable resource among several agents. In the fair division of chores, each agent only gets the disutility from its own piece. Agents may, however, also be…
Rearrangements of bacterial chromosomes can be studied mathematically at several levels, most prominently at a local, or sequence level, as well as at a topological level. The biological changes involved locally are inversions, deletions,…
A mathematical model for behavioral changes by pair interactions (i.e. due to direct contact) of individuals is developed. Three kinds of pair interactions can be distinguished: Imitative processes, avoidance processes, and compromising…
This paper is concerned with the study of a model case of first order Hamilton-Jacobi equations posed on a "junction", that is to say the union of a finite number of half-lines with a unique common point. The main result is a comparison…
In this article, we investigate the arithmetical hierarchy from the perspective of realizability theory. An experimental observation in classical computability theory is that the notion of degrees of unsolvability for natural arithmetical…
Routing and scheduling problems are fundamental problems in combinatorial optimization, and also have many applications. Most variations of these problems are NP-Hard, so we need to use heuristics to solve these problems on large instances,…
In this paper, we analyze the problem of how to adapt the concept of proportionality to situations where several perfectly divisible resources have to be allocated among certain set of agents that have exactly one claim which is used for…
A public decision-making problem consists of a set of issues, each with multiple possible alternatives, and a set of competing agents, each with a preferred alternative for each issue. We study adaptations of market economies to this…