Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence 2018
DOI: 10.24963/ijcai.2018/23
|View full text |Cite
|
Sign up to set email alerts
|

Bidding in Periodic Double Auctions Using Heuristics and Dynamic Monte Carlo Tree Search

Abstract: In a Periodic Double Auction (PDA), there are multiple discrete trading periods for a single type of good. PDAs are commonly used in real-world energy markets to trade energy in specific time slots to balance demand on the power grid. Strategically, bidding in a PDA is complicated because the bidder must predict and plan for future auctions that may influence the bidding strategy for the current auction. We present a general bidding strategy for PDAs based on forecasting clearing prices and using Monte Carlo T… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 14 publications
(5 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…Periodic double auction allows the bidding only during a specified market clearing period [99]. A periodic double auctionbased bidding strategy was implemented in [100], which forecasts clearing prices for different time periods and perform Monte Carlo tree search to design the bids for multiple time periods. In k-double auction, the market clearing price is determined from the range between the highest seller bid and lowest buyer bid so that no seller/buyer will have to receive/pay less/more than their bids [101].…”
Section: Auction Methodsmentioning
confidence: 99%
“…Periodic double auction allows the bidding only during a specified market clearing period [99]. A periodic double auctionbased bidding strategy was implemented in [100], which forecasts clearing prices for different time periods and perform Monte Carlo tree search to design the bids for multiple time periods. In k-double auction, the market clearing price is determined from the range between the highest seller bid and lowest buyer bid so that no seller/buyer will have to receive/pay less/more than their bids [101].…”
Section: Auction Methodsmentioning
confidence: 99%
“…First, we illustrate that the MDP based strategy indeed achieves the equilibrium strategy characterized for OBOS setting. Then, we conduct different experiments to compare MDPLCPBS with the following strategies: ZI (Gode and Sunder 1993), ZIP (Tesauro and Das 2001), TacTex (Urieli and Stone 2014), and MCTS (Chowdhury et al 2018). Our analysis shows that MDPLCPBS outperforms ZI, TacTex, and ZIP in all the cases, and closely matches with MCTS.…”
Section: Introductionmentioning
confidence: 90%
“…For the first time, Schvartzman and Wellman combined empirical game theory with the Q-learning algorithm in reinforcement learning to analyze the optimal trading strategy of traders in the double auction market [32], but this algorithm is only suitable for a small and discrete space of bidding actions. Chowdhury et al proposed a trading strategy using Monte Carlo Tree Search (MCTS) [33]. However, this algorithm is suitable for discrete bidding sets and cannot deal with bidding problems with continuous types and action spaces.…”
Section: Related Workmentioning
confidence: 99%