Current approaches that model dynamism in DCOPs solve a sequence of static problems, reacting to changes in the environment as the agents observe them. Such approaches thus ignore possible predictions on future changes. To overcome this limitation, we ...

In this demonstration paper, we introduce NAKED: a new generator for n-ary logic-based argumentation frameworks instantiated from inconsistent knowledge bases expressed using \datalog. The tool allows to import a knowledge base in DLGP format, generate, ...

Monte Carlo Tree Search (MCTS) is a best-first search which is efficient in large search spaces and is effective at balancing exploration versus exploitation. In this work, we introduce a novel extension for MCTS, called Multiagent Monte Carlo Tree ...

We study the φ_f-Outliers problem, where we are given an election and are asked whether there are at most n votes whose removal leads to the existence of a k-committee of a desired quality under the voting rule φ_f. We investigate the (parameterized) ...

Unmanned autonomous vehicle assisted information gathering missions have quickly picked up interest. Indeed, the advances on drones are making this type of missions possible. Thus, we study multi-agent path planning problems, namely reachability and ...

Matching markets with historical data are abundant in many applications, e.g., matching candidates to jobs in hiring, workers to tasks in crowdsourcing markets, and jobs to servers in cloud services. In all these applications, a match consumes one or ...

It is well known that chargingmarginal cost tolls (MCT) from self interested agents participating in a congestion game leads to optimal system performance, i.e., minimal total latency. However, it is not generally possible to calculate the correct ...

Task assignment and routing are tightly coupled problems for teams of mobile agents. To fairly balance the workload, each agent should be assigned a set of tasks which take a similar amount of time to complete. The completion time depends on the time ...

In many real-life scenarios, a group of agents needs to agree on a common action, e.g., on a location for a public facility, while there is some consistency between their preferences, e.g., all preferences are derived from a common metric space. The ...

We initiate the systematic algorithmic study for gerrymandering over graphs that was recently introduced by Cohen-Zemach, Lewenberg and Rosenschein. Namely, we study a strategic procedure for a political districting designer to draw electoral district ...

We consider a generalization of zero-sum patrolling security game that allows the attacker choosing when, where, and how long to launch an attack, under three different attacker models. The attacker's payoff is the acquired utilities of the attack minus ...

We investigate the computational complexity of electoral control in elections. Electoral control describes the scenario where the election chair seeks to alter the outcome of the election by structural changes such as adding, deleting, or replacing ...

Hat guessing games have drawn a lot of attention among mathematicians, computer scientists, coding theorists and even the mass press, due to their relations to graph theory, circuit complexity, network coding, and auctions. In this paper, we investigate ...

Weighted Constraint Satisfaction Problems (WCSPs) are an elegant paradigm for modeling combinatorial optimization problems. A key assumption in this model is that all constraints are specified or known a priori, which does not hold in some applications ...