Related papers: Cooperation in Combinatorial Search
Many practical search problems concern the search for multiple hidden objects or agents, such as earthquake survivors. In such problems, knowing only the list of possible locations, the Searcher needs to find all the hidden objects by…
The paper describes clustering problems from the combinatorial viewpoint. A brief systemic survey is presented including the following: (i) basic clustering problems (e.g., classification, clustering, sorting, clustering with an order over…
Utilizing common resources is always a dilemma for community members. While cooperator players restrain themselves and consider the proper state of resources, defectors demand more than their supposed share for a higher payoff. To avoid the…
Cooperation and competition are fundamental forces shaping both natural and human systems, yet their interplay remains poorly understood. The Prisoner's Dilemma Game (PDG) has long served as a foundational framework in Game Theory for…
We investigate the spatial distribution and the global frequency of agents who can either cooperate or defect. The agent interaction is described by a deterministic, non-iterated prisoner's dilemma game, further each agent only locally…
Enumeration problems aim at outputting, without repetition, the set of solutions to a given problem instance. However, outputting the entire solution set may be prohibitively expensive if it is too big. In this case, outputting a small,…
The field of Game Theory provides a useful mechanism for modeling many decision-making scenarios. In participating in these scenarios individuals and groups adopt particular strategies, which generally perform with varying levels of…
Unlike the traditional model of information pull, matchmaking is base on a cooperative partnership between information providers and consumers, assisted by an intelligent facilitator (the matchmaker). Refer to some experiments, the…
Efficiently tackling combinatorial reasoning problems, particularly the notorious NP-hard tasks, remains a significant challenge for AI research. Recent efforts have sought to enhance planning by incorporating hierarchical high-level search…
Distributed computing often gives rise to complex concurrent and interacting activities. In some cases several concurrent activities may be working together, i.e. cooperating, to solve a given problem; in other cases, the activities may be…
In group testing, the task is to determine the distinguished members of a set of objects L by asking subset queries of the form ``does the subset Q of L contain a distinguished object?'' The primary biological application of group testing…
We analyze different ways of pairing agents in a bipartite matching problem, with regard to its scaling properties and to the distribution of individual ``satisfactions''. Then we explore the role of partial information and bounded…
How attention scarcity effects the outcomes of a game? We present our findings on a version of the Iterated Prisoners Dilemma (IPD) game in which players can accept or refuse to play with their partner. We study the memory size effect on…
The Prisoner's Dilemma (PD) deals with the cooperation/defection conflict between two agents. The agents are represented by a cell of $L \times L$ square lattice. The agents are initially randomly distributed according to a certain…
In the traditional setup of public goods game all players are involved in every available groups and the mutual benefit is shared among competing cooperator and defector strategies. But in real life situations the group formation of players…
The main challenge of combinatorial game theory is to handle combinatorial chaos, if one player knows the strategy better than his opponent, he is able to determine the exact results of a game. If both players are qualified competitor, the…
A common economic process is crowdsearch, wherein a group of agents is invited to search for a valuable physical or virtual object, e.g. creating and patenting an invention, solving an open scientific problem, or identifying vulnerabilities…
In the quantum database search problem we are required to search for an item in a database. In this paper, we consider a generalization of this problem, where we are provided d identical copes of a database each with N items which we can…
Applications involving humans and robots working together are spreading nowadays. Alongside, modeling and control techniques that allow physical Human-Robot Interaction (pHRI) are widely investigated. To better understand its potential…
We consider a single buyer with a combinatorial preference that would like to purchase related products and services from different vendors, where each vendor supplies exactly one product. We study the general case where subsets of products…