A Study of Central Auction Based Wholesale Electricity Markets S. Ceppi and N. Gatti.

Slides:



Advertisements
Similar presentations
S. Ceppi, N. Gatti, and N. Basilico DEI, Politecnico di Milano Computing Bayes-Nash Equilibria through Support Enumeration Methods in Bayesian Two-Player.
Advertisements

Algorithm Design Methods (I) Fall 2003 CSE, POSTECH.
CPS Bayesian games and their use in auctions Vincent Conitzer
Computer-aided mechanism design Ye Fang, Swarat Chaudhuri, Moshe Vardi 1.
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
Multi-item auctions with identical items limited supply: M items (M smaller than number of bidders, n). Three possible bidder types: –Unit-demand bidders.
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Do software agents know what they talk about? Agents and Ontology dr. Patrick De Causmaecker, Nottingham, March
A Prior-Free Revenue Maximizing Auction for Secondary Spectrum Access Ajay Gopinathan and Zongpeng Li IEEE INFOCOM 2011, Shanghai, China.
Pablo Serra Universidad de Chile Forward Contracts, Auctions and Efficiency in Electricity Markets.
Confidentiality/date line: 13pt Arial Regular, white Maximum length: 1 line Information separated by vertical strokes, with two spaces on either side Disclaimer.
Nash equilibria in Electricity Markets: A comparison of different approaches Seminar in Electric Power Networks, 12/5/12 Magdalena Klemun Master Student,
1/22 Competitive Capacity Sets Existence of Equilibria in Electricity Markets A. Downward G. ZakeriA. Philpott Engineering Science, University of Auckland.
Regret Minimization and the Price of Total Anarchy Paper by A. Blum, M. Hajiaghayi, K. Ligett, A.Roth Presented by Michael Wunder.
Economics 202: Intermediate Microeconomic Theory 1.HW #6 on website. Due Tuesday. 2.Second test covers up through today’s material, and will be “pseudo-cumulative”
Seminar In Game Theory Algorithms, TAU, Agenda  Introduction  Computational Complexity  Incentive Compatible Mechanism  LP Relaxation & Walrasian.
Chunyang Tong Sriram Dasu Information & Operations Management Marshall School of Business University of Southern California Los Angeles CA Dynamic.
1 Sealed Bid Multi-object Auctions with Necessary Bundles and its Application to Spectrum Auctions ver. 1.0 University of Tokyo 東京大学 松井知己 Tomomi Matsui.
A Computational Characterization of Multiagent Games with Fallacious Rewards Ariel D. Procaccia and Jeffrey S. Rosenschein.
An Introduction to Game Theory Part I: Strategic Games
Satisfaction Equilibrium Stéphane Ross. Canadian AI / 21 Problem In real life multiagent systems :  Agents generally do not know the preferences.
Employing and Evaluating Dynamic Pricing Strategies Joan Morris MS Thesis Proposal Research Hour, 11/30/00.
Game-Theoretic Approaches to Multi-Agent Systems Bernhard Nebel.
Algorithmic Game Theory Nicola Gatti and Marcello Restelli {ngatti, DEI, Politecnico di Milano, Piazza Leonardo da Vinci 32, Milano,
A Game Theoretic Approach to Provide Incentive and Service Differentiation in P2P Networks John C.S. Lui The Chinese University of Hong Kong Joint work.
1 An Analysis for Troubled Assets Reverse Auction Saeed Alaei (University of Maryland-College Park) Azarakhsh Malekian (University of Maryland-College.
A Heuristic Bidding Strategy for Multiple Heterogeneous Auctions Patricia Anthony & Nicholas R. Jennings Dept. of Electronics and Computer Science University.
Dynamic Spectrum Management: Optimization, game and equilibrium Tom Luo (Yinyu Ye) December 18, WINE 2008.
Selfish Caching in Distributed Systems: A Game-Theoretic Analysis By Byung-Gon Chun et al. UC Berkeley PODC’04.
Nov 2003Group Meeting #2 Distributed Optimization of Power Allocation in Interference Channel Raul Etkin, Abhay Parekh, and David Tse Spectrum Sharing.
A Payment-based Incentive and Service Differentiation Mechanism for P2P Streaming Broadcast Guang Tan and Stephen A. Jarvis Department of Computer Science,
Distributed Rational Decision Making Sections By Tibor Moldovan.
1 A Look at Simple, Learnable Pricing Policies in Electricity Markets Steve Kimbrough Fred Murphy INFORMS, November 2005 File: sok-murphy-informs-2005.ppt.
Network Formation Games. Netwok Formation Games NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models:
Department of Telecommunications MASTER THESIS Nr. 608 MASTER THESIS Nr. 608 INTELLIGENT TRADING AGENT FOR POWER TRADING THROUGH WHOLESALE MARKET Ivo Buljević.
Equilibrium problems with equilibrium constraints: A new modelling paradigm for revenue management Houyuan Jiang Danny Ralph Stefan Scholtes The Judge.
Energy Trading in the Smart Grid: From End-user’s Perspective Shengbo Chen Electrical and Computer Engineering & Computer Science and Engineering.
Computing Equilibria in Electricity Markets Tony Downward Andy Philpott Golbon Zakeri University of Auckland.
A Projection Framework for Near- Potential Polynomial Games Nikolai Matni Control and Dynamical Systems, California.
Confidentiality/date line: 13pt Arial Regular, white Maximum length: 1 line Information separated by vertical strokes, with two spaces on either side Disclaimer.
Changing Perspective… Common themes throughout past papers Repeated simple games with small number of actions Mostly theoretical papers Known available.
NOBEL WP Szept Stockholm Game Theory in Inter-domain Routing LÓJA Krisztina - SZIGETI János - CINKLER Tibor BME TMIT Budapest,
ECO290E: Game Theory Lecture 12 Static Games of Incomplete Information.
An Online Procurement Auction for Power Demand Response in Storage-Assisted Smart Grids Ruiting Zhou †, Zongpeng Li †, Chuan Wu ‡ † University of Calgary.
An Online Auction Framework for Dynamic Resource Provisioning in Cloud Computing Weijie Shi*, Linquan Zhang +, Chuan Wu*, Zongpeng Li +, Francis C.M. Lau*
Mechanism Design CS 886 Electronic Market Design University of Waterloo.
Presenter: Chih-Yuan Chou GA-BASED ALGORITHMS FOR FINDING EQUILIBRIUM 1.
MAP: Multi-Auctioneer Progressive Auction in Dynamic Spectrum Access Lin Gao, Youyun Xu, Xinbing Wang Shanghai Jiaotong University.
PENN S TATE Department of Industrial Engineering 1 Revenue Management in the Context of Dynamic Oligopolistic Competition Terry L. Friesz Reetabrata Mookherjee.
INVESTIGATORS R. King S. Fang J. Joines H. Nuttle STUDENTS N. Arefi Y. Dai S. Lertworasirikul Industrial Engineering Textiles Engineering, Chem. and Science.
Regret Minimizing Equilibria of Games with Strict Type Uncertainty Stony Brook Conference on Game Theory Nathanaël Hyafil and Craig Boutilier Department.
Artificial intelligence methods in the CO 2 permission market simulation Jarosław Stańczak *, Piotr Pałka **, Zbigniew Nahorski * * Systems Research Institute,
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Computing and Approximating Equilibria: How… …and What’s the Point? Yevgeniy Vorobeychik Sandia National Laboratories.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
The Achievements and the Future of Game Theory: A User's Perspective
Algorithmic, Game-theoretic and Logical Foundations
Agent Based Models and Common Value Auctions B. Wade Brorsen.
Pricing of Competing Products BI Solutions December
On the Difficulty of Achieving Equilibrium in Interactive POMDPs Prashant Doshi Dept. of Computer Science University of Georgia Athens, GA Twenty.
Network Formation Games. NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models: Global Connection Game.
Multi-Agents System CMSC 691B Gunjan Kalra Peter DSouza.
Network Formation Games. NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models: Global Connection Game.
Game theory basics A Game describes situations of strategic interaction, where the payoff for one agent depends on its own actions as well as on the actions.
Satisfaction Games in Graphical Multi-resource Allocation
Near-Optimal Spectrum Allocation for Cognitive Radios: A Frequency-Time Auction Perspective Xinyu Wang Department of Electronic Engineering Shanghai.
Algorithmic Game Theory and Internet Computing
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 2 Bayesian Games Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Market Oriented Programming
Market Oriented Programming
Presentation transcript:

A Study of Central Auction Based Wholesale Electricity Markets S. Ceppi and N. Gatti

2 Index Problem Analysis Context: electricity market Problem: finding the market equilibria State of the Art Original Contributions Introduction of the auction mechanism Finding the auction optimal solution Finding the equilibria in the market Conclusions and Future Works

S. Ceppi and N. Gatti Problem Analysis

S. Ceppi and N. Gatti Italian Electricity Market

S. Ceppi and N. Gatti Wholesale Market K K K K Q € Q € Q € Q € Q € Q € Q €

S. Ceppi and N. Gatti State of the Art Problem: finding the best prices Microeconomic problem → Game Theory Two approches in literature: 1.Multi-agent simulation [Praca et al., 2003] Usually there is not any theoretical guarantee that adaptive/learning agents can converge to the optimal strategy 2.Game theoretical: POOLCO model [Hobbs, 2001] It is based on the Cournot oligopoly: generators choose only the amount of electricity to sell, while the price is a function of electricity demand and supply It admits a unique equilibrium In the equilibrium all the generators bid the same price No real-world auction mechanism is considered

S. Ceppi and N. Gatti Original Contributions

S. Ceppi and N. Gatti Real-World Auction Mechanism Generator: Action: bid a price per electicity unit for each local region in which it produces Goal: maximize its utility Electricity Market Manager (EMM): Actions: Choose the generators from which to buy electricity Choose the amount of electricity to buy from each generator Goal: minimize the clearing price Constraints: Satisfy the customers’ demand of electricity Generators capacities Network capacity Market rules

S. Ceppi and N. Gatti Market Rules

S. Ceppi and N. Gatti Winner Determination Steps: Bids collection Bids ordering Bids acceptance until the customers’ demand is satisfied

S. Ceppi and N. Gatti Finding Equilibrium Strategies Solution Concept: Nash equilibrium in pure strategies Reduction of the model Infinite possible actions → finite possible actions Search algorithm based on Best Response Dynamics Use of Tabu List to ensure that the algorithm ends Implementation Static Dynamic

S. Ceppi and N. Gatti Conclusions and Future Works

S. Ceppi and N. Gatti Conclusions Context: wholesale electricity market based on a central auction Original Contributions: Enrichment of the model presented in literature with a real- world auction mechanism Greedy Algorithm to find the best solution of the Winner Determination Problem for the auction Computation of the equilibrium strategy using a solving algorithm based on best response search The introduction of the auction mechanism leads to an equilibrium which is different from that obtained in its absence: There exist multiple equilibria Generators, in general, bid different prices at the equilibrium

S. Ceppi and N. Gatti Future Works Efficiency improvement of the algorithms for: Winner Determination Problem Equilibrium Computation Equilibrium characterization by Evolutionary Game Theory for the selection of one equilibrium when multiple equilibria exist Study of the auction mechanism in the presence of uncertain information Bayesian Games perspective Mechanism Design perspective