• Corpus ID: 214803086

Using Multi-Agent Reinforcement Learning in Auction Simulations

  title={Using Multi-Agent Reinforcement Learning in Auction Simulations},
  author={Medet Kanmaz and Elif Surer},
Game theory has been developed by scientists as a theory of strategic interaction among players who are supposed to be perfectly rational. These strategic interactions might have been presented in an auction, a business negotiation, a chess game, or even in a political conflict aroused between different agents. In this study, the strategic (rational) agents created by reinforcement learning algorithms are supposed to be bidder agents in various types of auction mechanisms such as British… 


Market Performance of Adaptive Trading Agents in Synchronous Double Auctions
Experimental results showed that in terms of global market efficiency, QLAs could outperform TTAs and GBGAs but could not outperform SRBAs in the market of homogeneous type of agents.
Pricing in Agent Economies Using Multi-Agent Q-Learning
This paper studies simultaneous Q-learning by two competing seller agents in three moderately realistic economic models and finds that, despite the lack of theoretical guarantees, simultaneous convergence to self-consistent optimal solutions is obtained in each model, at least for small values of the discount parameter.
A Reinforcement Learning Model to Assess Market Power Under Auction-Based Energy Pricing
Auctions serve as a primary pricing mechanism in various market segments of a deregulated power industry. In day-ahead (DA) energy markets, strategies such as uniform price, discriminatory, and
Game Theory and Multi-agent Reinforcement Learning
A basic learning framework based on the economic research into game theory is described, and a representative selection of algorithms for the different areas of multi-agent reinforcement learning research is described.
Markov Games as a Framework for Multi-Agent Reinforcement Learning
A Q-learning-like algorithm for finding optimal policies and its application to a simple two-player game in which the optimal policy is probabilistic is demonstrated.
Multiagent Inverse Reinforcement Learning for Two-Person Zero-Sum Games
A theoretical foundation for competitive two-agent zero-sum MIRL problems is established and a Bayesian solution approach is proposed in which the generative model is based on an assumption that the two agents follow a minimax bipolicy.
A Deep Q-Network for the Beer Game: A Deep Reinforcement Learning algorithm to Solve Inventory Optimization Problems.
A machine learning algorithm, based on deep Q-networks, to optimize the replenishment decisions at a given stage of the beer game, which can be extended to other decentralized multi-agent cooperative games with partially observed information, which is a common type of situation in real-world supply chain problems.
Reinforcement Mechanism Design for e-commerce
This work model the problem of allocating impressions to sellers in e-commerce websites, such as Amazon, eBay or Taobao as a Markov decision process, and designs an actor-critic policy gradient algorithm which takes advantage of the problem domain in order to achieve convergence and stability.
Actor-Critic Algorithms for Learning Nash Equilibria in N-player General-Sum Games
We consider the problem of finding stationary Nash equilibria (NE) in a finite discounted general-sum stochastic game. We first generalize a non-linear optimization problem from Filar and Vrieze
Large Scale Learning of Agent Rationality in Two-Player Zero-Sum Games
This paper draws upon well-known ideas in decision theory to obtain a concise and interpretable agent behavior model, and derive solvers and gradients for end-to-end learning and proposes an efficient first-order primal-dual method which exploits the structure of extensive-form games.