Related papers: Adaptive Manipulation for Coalitions in Knockout T…
We study the population genetics of Evolution in the important special case of weak selection, in which all fitness values are assumed to be close to one another. We show that in this regime natural selection is tantamount to the…
The paper discusses the strategy-proofness of sports tournaments with multiple group stages, where the results of matches already played in the previous round against teams in the same group are carried over. These tournaments, widely used…
This paper studies cooperative games where coalitions are formed online and the value generated by the grand coalition must be irrevocably distributed among the players at each timestep. We investigate the fundamental issue of strategic…
We initiate the study of simple games from the point of view of combinatorial topology. The starting premise is that the losing coalitions of a simple game can be identified with a simplicial complex. Various topological constructions and…
In today's dynamic and interconnected world, resource constraints pose significant challenges across various domains, ranging from networks, logistics and manufacturing to project management and optimization, etc. Resource-constrained…
We tackle the problem of partitioning players into groups of fixed size, such as allocating eligible students to shared dormitory rooms. Each student submits preferences over the other individual students. We study several settings, which…
A comply/constrain game or a game with a Muller twist is a game where the next player is allowed to place constraints on opponent's next move. We develop a closed form formula for the Grundy value of the single-pile subtraction game where…
The NBA draft can incentivize teams to deliberately lose. We propose a draft mechanism that is practical, incentive-compatible, and favors weaker teams. The Carry-Over Lottery Allocation (COLA) framework represents a paradigm shift in…
We study a social choice setting of manipulation in elections and extend the usual model in two major ways: first, instead of considering a single manipulating agent, in our setting there are several, possibly competing ones; second,…
Understanding the properties of games played under computational constraints remains challenging. For example, how do we expect rational (but computationally bounded) players to play games with a prohibitively large number of states, such…
The group draw of a sports tournament requires assigning teams to groups of (almost) the same size. The most important criteria for a draw procedure are balance, randomness, and transparency, which could not be satisfied simultaneously if…
Multi-round competitions often double or triple the points awarded in the final round, calling it a bonus, to maximize spectators' excitement. In a two-player competition with $n$ rounds, we aim to derive the optimal bonus size to maximize…
Coalitional games are mathematical models suited to analyze scenarios where players can collaborate by forming coalitions in order to obtain higher worths than by acting in isolation. A fundamental problem for coalitional games is to single…
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…
The generalization of the problem of adaptive competition, known as the minority game, to the case of $K$ possible choices for each player is addressed, and applied to a system of interacting perceptrons with input and output units of the…
We prove that it is NP-hard for a coalition of two manipulators to compute how to manipulate the Borda voting rule. This resolves one of the last open problems in the computational complexity of manipulating common voting rules. Because of…
The transitivity of preferences is one of the basic assumptions used in the theory of games and decisions. It is often equated with rationality of choice and is considered useful in building rankings. Intransitive preferences are considered…
We present a new problem called the incomplete Traveling Tournament problem, which introduces the well known Traveling Tournament Problem into the realm of incomplete round-robin tournaments. We focus on the case where teams can face each…
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating together preferences of multiple agents. We study here the…
The evolution of information and communication technologies has yielded the means of sharing measurements and other information in an efficient and flexible way, which has enabled the size and complexity of control applications to increase.…