Introduction

14
20/06/22 | Chart 1 Introduction Example for 1:n bundling with three TSOs border Country 1 Market Zone A Country 2 Market Zone B Each TSO creates it’s individual network point on the PRISMA platform The individual network points are not bundled yet and can only be used for unbundled auctions

description

Country 1 Market Zone A. border. Country 2 Market Zone B. Introduction. Example for 1:n bundling with three TSOs. Each TSO creates it ’ s individual network point on the PRISMA platform The individual network points are not bundled yet and can only be used for unbundled auctions. - PowerPoint PPT Presentation

Transcript of Introduction

Page 1: Introduction

20/04/23 | Chart 1

IntroductionExample for 1:n bundling with three TSOs

borderCountry 1Market Zone A

Country 2Market Zone B

Each TSO creates it’s individual network point on the PRISMA platform The individual network points are not bundled yet and can only be used for unbundled

auctions

Page 2: Introduction

20/04/23 | Chart 2

IntroductionExample for 1:n bundling with three TSOs

IPb_TSO1_EXIT

IPc_TSO1_EXIT

borderCountry 1Market Zone A

Country 2Market Zone B

To market bundled capacities two additional (virtual) bundled network points are created on the PRISMA platform

The additional network points use the master data of the underlying unbundled network points

IPa_TSO1_ENTRY

Page 3: Introduction

20/04/23 | Chart 3

Ascending Clock Auction Capacity situation leads to competing auctions

Situation 1:available capacity at A > sum of available capacity at B and C•several bundled products are created, for the remaining capacity a unbundled product may be created

90

40Bundle200

90

40 AB

ACBundle

Unbundled

Situation 2:available capacity at A < sum of available capacity at B and C•several bundled products are created•the sum of the allocated capacity must not exceed the available capacity at A, the two products are therefore competing for the amount of A

90

40

100

Bundle AB

ACBundle 90

40

AC

Page 4: Introduction

20/04/23 | Chart 4

Ascending Clock Auction Simulation of competing auctions

The two auctions at the bundle AB and AC take place in parallel on the PRISMA platform, according to the rules and procedures of a standard competing clock auction as described in the NC CAM.

After each bidding round the results are analysed and it is checked whether the competition constraint – available capacity at A (100) - is solved.

In case the competition constraint is solved, the capacity is allocated.

90

40

100

Bundle AB

ACBundle 90

40

Page 5: Introduction

20/04/23 | Chart 5

Ascending Clock Auction Simulation of competing auctions

70

Bundle ABPrice

Bids

40

140

Bundle ACPrice

Bids

90

The aggregated demand of bundle AB and AC is bigger than the competition constraint (AB +AC > A). The competition constraint is not solved, therefore the next bidding round is necessary. In the next bidding round the first large price step is applied to both auctions.

avail. capacityavail. capacity

P0 P0

Page 6: Introduction

20/04/23 | Chart 6

Ascending Clock Auction Simulation of competing auctions

Bundle ABPrice

Bids

40

Bundle ACPrice

90

The aggregated demand of bundle AB and AC is bigger than the competition constraint (AB +AC > A). The competition constraint is not solved, therefore the next bidding round is necessary. In the next bidding round the second large price step is applied to both auctions.

50 80

Bids

avail. capacityavail. capacity

P1 P1

Page 7: Introduction

20/04/23 | Chart 7

Ascending Clock Auction Simulation of competing auctions

Bundle ABPrice

Bids

40

Bundle ACPrice

90

The aggregated demand of bundle AB and AC smaller than the competition constraint (AB + AC < A). In order to solve the competition the auctions are split and continued independently from each other. Since AB is still in oversell the marketable capacity for AB stays 40 whereas AC is restricted to 60.

45 50

Bids

avail. capacityavail. capacity

P2 P2

Page 8: Introduction

20/04/23 | Chart 8

Ascending Clock Auction Simulation of competing auctions

Bundle ABPrice

Bids

40

Bundle ACPrice

90

The aggregated demand of bundle AB and AC is bigger than the competition constraint (AB +AC > A). The competition constraint is not solved, therefore the next bidding round is necessary. In the next bidding round the first small price step is applied to auctions AB and the second to AC.

38

65

Bids

60

internalrestriction

avail. capacityavail. capacity

P3

P4

Page 9: Introduction

20/04/23 | Chart 9

Ascending Clock Auction Simulation of competing auctions

Bundle ABPrice

Bids

40

Bundle ACPrice

90

avail. capacity

The aggregated demand of bundle AB and AC is smaller than the competition constraint (AB +AC < A). The competition constraint is solved and both auctions are in undersell, the auctions are finished. The capacity is allocated as follows: AB=39 and AC=55.

39

55

Bids

60

avail. capacity

internalrestriction

P5

P6

Page 10: Introduction

20/04/23 | Chart 10

Uniform Price Auction Simulation of competing auctions

The two auctions at the bundle AB and AC take place in parallel on the PRISMA platform, according to the rules and procedures of a standard uniform price auction as described in the NC CAM.

After each bidding round the results are analysed and it is checked whether the competition constraint - available capacity at A (100) - is solved.

In case the competition constraint is solved, the capacity is allocated.

90

40

100

Bundle AB

ACBundle 90

40

Page 11: Introduction

20/04/23 | Chart 11

Uniform Price Auction Simulation of competing auctions

40

Bundle ABSurcharge

Bids

40

avail. capacity

80

Bundle AC

avail. capacity

The Shippers place their bids during the bidding round. Uniform price auctions only have one bidding round in which up to 10 bids (price + amount) can be placed. The evaluation of the placed bids and the allocation of capacity is done in three steps.

1

2

50

Maximum amount Shipper 1

Minimum amount Shipper 1

Maximum amount Shipper 2

Minimum amount Shipper 2

Legend:

Surcharge

1

2

Bids

90

Maximum amount Shipper 3

Minimum amount Shipper 3

Page 12: Introduction

20/04/23 | Chart 12

Uniform Price Auction Simulation of competing auctions

40

Bundle ABSurcharge

Bids

40

avail. capacity

80

Bundle ACSurcharge

Bids

90

avail. capacity

During the intermediate evaluation both auctions are evaluated independently. The maximum amount of the bid of Shipper 3 for bundle AC is exceeding the available capacity and is amended

to 10 in order to meet the available capacity (taking into account, that the minimum amount of the bid is still met).

1st step: intermediate evaluation

10

1

2

1

2

Maximum amount Shipper 1

Minimum amount Shipper 1

Maximum amount Shipper 2

Minimum amount Shipper 2

Legend:

Maximum amount Shipper 3

Minimum amount Shipper 3

Page 13: Introduction

20/04/23 | Chart 13

Uniform Price Auction Simulation of competing auctions

In order to resolve the competition the two auctions have to be evaluated together. In preparation of the evaluation all bids that were placed are internally consolidated.

2nd step: consolidation of all bids

Bundle AB and ACSurcharge

avail. capacity

40

80

10

1

2

Bids

100

Maximum amount Shipper 1

Minimum amount Shipper 1

Maximum amount Shipper 2

Minimum amount Shipper 2

Legend:

Maximum amount Shipper 3

Minimum amount Shipper 3

Page 14: Introduction

20/04/23 | Chart 14

Uniform Price Auction Simulation of competing auctions

The consolidated bids are evaluated according to the rules and procedures described in the NC CAM. The maximum amount of the bid of Shipper 2 is allocated, since the Shipper is willing to pay a higher surcharge. The remaining capacity (20) is allocated according to the rules of NC CAM. In this case the allocation is done

pro-rata to the remaining bids (40 and 10).

3rd step: final evaluation and allocation

Bundle AB and ACSurcharge

avail. capacity

80

4

1

2

Bids

100

16

Clearingsurcharge

Maximum amount Shipper 1

Minimum amount Shipper 1

Maximum amount Shipper 2

Minimum amount Shipper 2

Legend:

Maximum amount Shipper 3

Minimum amount Shipper 3


An Introduction for An Introduction for Introduction for ......An Introduction for An Introduction for Introduction for TeachersTeachersTeachers . exChange, Blackburn Cathedral’s

An Introduction for An Introduction for Introduction for ......An Introduction for An Introduction for Introduction for TeachersTeachersTeachers . exChange, Blackburn Cathedral’s

Introduction and Welcome€¦ · Introduction and Welcome Introduction 4

Introduction and Welcome€¦ · Introduction and Welcome Introduction 4

R as a Web Service Introduction Introduction Introduction

R as a Web Service Introduction Introduction Introduction

Module: Introduction...Module: Introduction Page: Introduction CC0.1 Introduction Please give a general description and introduction to your organization. Providing electrical, hydraulic

Module: Introduction...Module: Introduction Page: Introduction CC0.1 Introduction Please give a general description and introduction to your organization. Providing electrical, hydraulic

Introduction to Elasticsearch and Logstash. - KIT · PDF fileOutline 1 Introduction 2 Logstash Introduction 3 Elasticsearch Introduction 4 Conclusions Introduction Logstash ElasticsearchConclusions

Introduction to Elasticsearch and Logstash. - KIT · PDF fileOutline 1 Introduction 2 Logstash Introduction 3 Elasticsearch Introduction 4 Conclusions Introduction Logstash ElasticsearchConclusions

 · Introduction . 6 . Contents . Introduction ...

 · Introduction . 6 . Contents . Introduction ...

Introduction€¦ · Introduction ThisdocumentprovidesinformationabouttheIOSXEsoftwarereleasefortheCiscoNCS4201andCisco …

Introduction€¦ · Introduction ThisdocumentprovidesinformationabouttheIOSXEsoftwarereleasefortheCiscoNCS4201andCisco …

General introduction 1.1 Introduction

General introduction 1.1 Introduction

Optimisation des Requêtes. Introduction Introduction.

Optimisation des Requêtes. Introduction Introduction.

Systems Analysis I introduction I introduction. 2Systems Analysis - Introduction Contents Introduction Introduction 3 classic phases 3 classic phases.

Systems Analysis I introduction I introduction. 2Systems Analysis - Introduction Contents Introduction Introduction 3 classic phases 3 classic phases.

 · Contents INTRODUCTION Introduction

 · Contents INTRODUCTION Introduction

§1.1.1 INTRODUCTION: 1. INTRODUCTION

§1.1.1 INTRODUCTION: 1. INTRODUCTION

1. Introduction 10 - therackonline.com€¦ · 1. Introduction 10 - therackonline.com ... Introduction)

1. Introduction 10 - therackonline.com€¦ · 1. Introduction 10 - therackonline.com ... Introduction)

Introduction: Definition Introduction: Philosophy

Introduction: Definition Introduction: Philosophy

Introduction | Introduction | Millennium Serials · 2018. 4. 17. · MARC Display | Print | Introduction | Millennium Serials INTRODUCTION Introduction This tutorial introduces the

Introduction | Introduction | Millennium Serials · 2018. 4. 17. · MARC Display | Print | Introduction | Millennium Serials INTRODUCTION Introduction This tutorial introduces the

Introduction Introduction Introduction Introduction.

Introduction Introduction Introduction Introduction.

Introduction Introduction (ctnd.)

Introduction Introduction (ctnd.)

Introduction Chapitre 1 · Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Introduction Chapitre 1 · Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Introduction to Transducers, Introduction to Transducers ...engtech.weebly.com/.../more_on_transducers_sensors_actuators.pdf · Introduction to Transducers, Introduction to Transducers,

Introduction to Transducers, Introduction to Transducers ...engtech.weebly.com/.../more_on_transducers_sensors_actuators.pdf · Introduction to Transducers, Introduction to Transducers,

INTRODUCTIONS (LEADS) Creative introduction Action introduction Dialogue introduction Personal introduction Question introduction Quotation introduction.

INTRODUCTIONS (LEADS) Creative introduction Action introduction Dialogue introduction Personal introduction Question introduction Quotation introduction.