Related papers: Local and global optimization in Parallel Minority…
In this paper we propose a new parallel algorithm for solving global optimization (GO) multidimensional problems. The method unifies two powerful approaches for accelerating the search: parallel computations and local tuning on the behavior…
Resource allocation systems provide the fundamental support for the normal functioning and well being of the modern society, and can be modeled as minority games. A ubiquitous dynamical phenomenon is the emergence of herding, where a vast…
Contemporary global optimization algorithms are based on local measures of utility, rather than a probability measure over location and value of the optimum. They thus attempt to collect low function values, not to learn about the optimum.…
We study a modification of the Evolutionary Minority Game (EMG) in which agents are placed in the nodes of a regular or a random graph. A neighborhood for each agent can thus be defined and a modification of the usual relaxation dynamics…
We study the computational complexity of solving stochastic games with mean-payoff objectives. Instead of identifying special classes in which simple strategies are sufficient to play $\epsilon$-optimally, or form $\epsilon$-Nash…
Population protocols are a model of distributed computing, in which $n$ agents with limited local state interact randomly, and cooperate to collectively compute global predicates. An extensive series of papers, across different communities,…
We calculate the standard deviation of (N1-N0), the difference of the number of agents choosing between the two alternatives of the minority game. Our approach is based on two approximations: we use the whole set of possible strategies,…
Game-theoretic motion planners are a powerful tool for the control of interactive multi-agent robot systems. Indeed, contrary to predict-then-plan paradigms, game-theoretic planners do not ignore the interactive nature of the problem, and…
We investigate how the framework of mean-field games may be used to investigate strategic interactions in large heterogeneous populations. We consider strategic interactions in a population of players which may be partitioned into…
In practical multi-agent systems, agents often have diverse objectives, which makes the system more complex, as each agent's performance across multiple criteria depends on the joint actions of all agents, creating intricate strategic…
Network games study the strategic interaction of agents connected through a network. Interventions in such a game -- actions a coordinator or planner may take that change the utility of the agents and thus shift the equilibrium action…
The strategic selection of resources by selfish agents is a classic research direction, with Resource Selection Games and Congestion Games as prominent examples. In these games, agents select available resources and their utility then…
Many real-world domains contain multiple agents behaving strategically with probabilistic transitions and uncertain (potentially infinite) duration. Such settings can be modeled as stochastic games. While algorithms have been developed for…
We investigate a coordination model for a two-stage collective decision-making problem within the framework of global games. The agents observe noisy signals of a shared random variable, referred to as the fundamental, which determines the…
In this paper we introduce a new approach for the study of the complex behavior of Minority Game using the tools of algorithmic complexity, physical entropy and information theory. We show that physical complexity and mutual information…
Multi-agent systems are designed to concurrently accomplish a diverse set of tasks at unprecedented scale. Here, the central problems faced by a system operator are to decide (i) how to divide available resources amongst the agents assigned…
The General Lotto game is a popular variant of the famous Colonel Blotto game, in which two opposing players allocate limited resources over many battlefields. In this paper, we consider incomplete and asymmetric information formulations…
We study episodic two-player zero-sum Markov games (MGs) in the offline setting, where the goal is to find an approximate Nash equilibrium (NE) policy pair based on a dataset collected a priori. When the dataset does not have uniform…
We consider 2-player games played on a finite state space for infinite rounds. The games are concurrent: in each round, the two players choose their moves simultaneously; the current state and the moves determine the successor. We consider…
We provide a theoretical description of the Minority Game in terms of crowd effects. The size of the fluctuations arising in the game is controlled by the interplay between crowds of like-minded agents and their anti-correlated partners…