Model-free learning for multi-agent stochastic games is an active area of research. Existing reinforcement algorithms, however, are often restricted to zero-sum games, and applicable only in small state-action spaces or other simplified settings. Here, we develop a new data efficient Deep-Q-learning methodology model-free Nash equilibria general-sum games. The algorithm uses local linear-quadra...

We consider colorful bin packing games in which selfish players control a set of items which are to be packed into a minimum number of unit capacity bins. Each item has one of m ≥ 2 colors and cannot be packed next to an item of the same color. All bins have the same unitary cost which is shared among the items it contains, so that players are interested in selecting a bin of minimum shared cos...

Nash equilibrium analysis has become the de facto standard for judging the solution quality achieved in systemscomposed of selfish users. This mindset is so pervasive in computer science that even the few papers devoted todirectly analyzing outcomes of dynamic processes in repeated games (e.g., best-response or no-regret learningdynamics) have focused on showing that the perform...

Industria imports oil, produces final goods and wishes to mitigate global warming. Oilrabia exports oil and buys final goods from the other country. Industria uses the carbon tax to impose an import tariff on oil and steal some of Oilrabia's scarcity rent. Conversely, Oilrabia has monopoly power and sets the oil price to steal some of Industria's climate rent. We analyze the relative speeds of ...

We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand; demands are drawn according to some probability distribution. The cost paid by an agent for a resource she chooses is the total demand put on the resource divided by the number of agents who chose that same resource. So, resource...

We consider a general multi-agent framework in which a set of n agents are roaming a network where m valuable and sharable goods (or resources or services or information) are hidden in m different vertices of the network. We analyze several strategic situations that arise in this setting by means of game theory. To do so we introduce a class of strategic search games. In such a game each agent ...

Duopoly game theory is applied to the wood industrial markets (sawnwood and pulpwood markets) in the North of Iran. The Nash equilibrium and the dynamic properties of the system based on marginal adjustments are determined. The probability that the Nash equilibrium will be reached is almost zero. The dynamical properties of sawnwood and pulpwood prices derived via the duopoly game model are fou...