相关论文: Tolerance is Necessary for Stability: Single-Peake…

This paper gives a complete analysis of worst-case equilibria for various versions of weighted congestion games with two players and affine cost functions. The results are exact price of anarchy bounds which are parametric in the weights of…

In the multidimensional stable roommate problem, agents have to be allocated to rooms and have preferences over sets of potential roommates. We study the complexity of finding good allocations of agents to rooms under the assumption that…

We consider the behavior of the price of anarchy and equilibrium flows in nonatomic multi-commodity routing games as a function of the traffic demand. We analyze their smoothness with a special attention to specific values of the demand at…

We consider eager-push epidemic dissemination in a complete graph. Time is divided into synchronous stages. In each stage, a source disseminates $\nu$ events. Each event is sent by the source, and forwarded by each node upon its first…

We consider a version of large population games whose agents compete for resources using strategies with adaptable preferences. The games can be used to model economic markets, ecosystems or distributed control. Diversity of initial…

We consider the dynamics, existence and stability of the equilibrium states for large populations of individuals who can play various types of non--cooperative games. The players imitate the most attractive strategies, and the choice is…

We study a simple exchange model in which price is fixed and the amount of a good transferred between actors depends only on the actors' respective budgets and the existence of a link between transacting actors. The model induces a…

We study network connection games where the nodes of a network perform edge swaps in order to improve their communication costs. For the model proposed by Alon et al. (2010), in which the selfish cost of a node is the sum of all shortest…

This paper studies controlling segregation in social networks via exogenous incentives. We construct an edge formation game on a directed graph. A user (node) chooses the probability with which it forms an inter- or intra- community edge…

The cost-sharing connection game is a variant of routing games on a network. In this model, given a directed graph with edge costs and edge capacities, each agent wants to construct a path from a source to a sink with low cost. The users…

Self-play is a technique for machine learning in multi-agent systems where a learning algorithm learns by interacting with copies of itself. Self-play is useful for generating large quantities of data for learning, but has the drawback that…

Games with incomplete preferences are an important model for studying rational decision-making in scenarios where players face incomplete information about their preferences and must contend with incomparable outcomes. We study the problem…

This paper is concerned with general spatially explicit versions of three stochastic models for the dynamics of money that have been introduced and studied numerically by statistical physicists: the uniform reshuffling model, the immediate…

Synthesis of finite-state controllers from high-level specifications in multi-agent systems can be reduced to solving multi-player concurrent games over finite graphs. The complexity of solving such games with qualitative objectives for…

TheMinority Game (MG) has become a paradigm to probe complex social and economical phenomena where adaptive agents compete for a limited resource, and it finds applications in statistical and nonlinear physics as well. In the traditional MG…

Agents are represented by nodes on a random graph (e.g., small world or truncated power law). Each agent is endowed with a zero-mean random value that may be either positive or negative. All agents attempt to find relief, i.e., to reduce…

We study coordination mechanisms for Scheduling Games (with unrelated machines). In these games, each job represents a player, who needs to choose a machine for its execution, and intends to complete earliest possible. Our goal is to design…

We consider multi-agent decision making where each agent's cost function depends on all agents' strategies. We propose a distributed algorithm to learn a Nash equilibrium, whereby each agent uses only obtained values of her cost function at…

We study the performance of approximate Nash equilibria for linear congestion games. We consider how much the price of anarchy worsens and how much the price of stability improves as a function of the approximation factor $\epsilon$. We…

A recently introduced restricted variant of the multidimensional stable roommate problem is the roommate diversity problem: each agent belongs to one of two types (e.g., red and blue), and the agents' preferences over the coalitions solely…