# A Pareto Optimal Auction Mechanism for Carbon Emission Rights

Authors: Mingxi Wang; Mingrong Wang; Chuangyin Dang; Shouyang Wang
Journal: Mathematical Problems in Engineering
 (2014)

---

## Abstract

The carbon emission rights do not fit well into the framework of existing multi-item auction mechanisms because of their own unique features. This paper proposes a new auction mechanism which converges to a unique Pareto optimal equilibrium in a finite number of periods. In the proposed auction mechanism, the assignment outcome is Pareto efficient and the carbon emission rights’ resources are efficiently used. For commercial application and theoretical completeness, both discrete and continuous markets—represented by discrete and continuous bid prices, respectively—are examined, and the results show the existence of a Pareto optimal equilibrium under the constraint of individual rationality. With no ties, the Pareto optimal equilibrium can be further proven to be unique.


---

## Body

## 1. Introduction

An emission-right market is an economic instrument to correct the market failure caused by negative environmental externality. The study of the emission-right market has long been a major issue in economic research (in the 1960s, Coase [1], Crocker [2], and Dales [3] proposed the seminal idea of an emission-right market; in 1988, Baumol and Oates [4] developed the theoretical framework for the emission-right market) and blossomed since the conference of the Parties of Kyoto in 1997 (see, e.g., Linares and Romero [5], Georgopoulou et al. [6], Nordhaus [7], Jotzo and Pezzey [8], Tol [9], Zhang [10], and Burniaux and Oliveira Martins [11]). To meet the goal of carbon emission reduction in the Kyoto Protocol, European Union in 2005 established the auction-and-trade scheme which makes the carbon emission right a tradable commodity. (The auction-and-trade scheme was initially known as the emission-and-trade scheme. With time, the percentage of carbon emission right traded is fast increasing by auction. Capoor and Ambrosi [12] estimated that 70–80% of carbon emission allowances would be auctioned by 2020. Therefore, the emission-and-trade scheme is often called to be the auction-and-trade scheme.)The auction-and-trade scheme provides one way of addressing the question of price formation of carbon emission rights; however it fails to answer such an important and practical question as whether or not the assignment outcome is efficient. Krishna [13] demonstrated in a single item setting that the assignment outcomes closely depend on the auction mechanism design and the resale after the auction sometimes fails to attain efficient outcomes. In multiple items situation, Milgrom [14] mentioned that an inefficient initial assignment cannot, in general, be quickly corrected by trading in items after the auction is complete. Therefore, it is both interesting and challenging to design an auction mechanism to attain an efficient assignment in the auction-and-trade scheme.The existing auction mechanisms for multiple items (such as Ausubel [15], Mishra and Garg [16], Mishra and Veeramani [17], Avenali [18], Choi et al. [19], Sun and Yang [20], Goel et al. [21], Shih et al. [22], and Liu [23]) are inappropriate for carbon emission rights due to their unique features. On one hand, the carbon emission right bears a strong resemblance to the ordinary commodity. Given the production technology, the producer, who uses more carbon emission rights as an input factor in the production, can emit more CO2 and further produces more outputs. On the other hand, the carbon emission right is significantly different from the ordinary commodity. In the auction-and-trade scheme, the carbon emission right is transferred from the auctioneer (or government) to bidders (or companies). The bidder, winning the right, pays for it at the auction price to the auctioneer. However, the auctioneer obtains the environmental profit (or more clean air) from carbon emission reduction relative to the business-as-usual case, other than the auction price. Besides, the carbon emission right has a limited duration of validity and its value will expire after commitment period. Meanwhile, the trade of carbon emission right influences the industrial structure by bidders’ decision. (Carbon emissions are caused by the fuel of carbon-based energy. Thus, if the price of carbon emission right is high, emitting entities may change their production process in two aspects. On one hand, to reduce cost and obtain certain profit, they may change their input combinations by replacing carbon-based energy with clean energy. On the other hand, to remain in business, entities may change their outputs by creating some new “green goods.” Subsequently, the associated upriver and downriver industries must do corresponding adjustments. Then, the industrial structure will change.) Thus, the auction mechanism design for carbon emission rights will be different from that for ordinary items.Such unique features make the auction mechanism design problem as to carbon emission rights allowance become more difficult. Generally speaking, a series of papers have been published on carbon emission rights auctions in the management science and operation research literature, but from the perspective of arguing EU ETS (Emissions Trading Scheme). In particular, Benz and Truck [24] describes the issue concerning how carbon emission rights become a class of tradable assets, Benz et al. [25] and Cramton and Kerr [26] analyze alternative initial allowance methods of carbon emission rights (auctioning or grandfathering), and Capoor and Ambrosi [12], Grubb [27], Clò [28], and Kruger [29] comment on the efficiency and effectiveness of carbon emission reduction in the ETS. However, these papers focus on the management performance of the ETS and its implementability, leaving open associated auction mechanism design problem. Burtraw et al. [30] and Holt et al. [31] are among the few papers that investigate the auction mechanism design problem of carbon emission rights. Yet, there is no paper that examines the problem from the viewpoint of existence and uniqueness of equilibrium.Enlightening by thetatonnement process, we develop a Pareto optimal auction mechanism for carbon emission rights. Several issues arise. The first one is how to design auction rules to make the final assignment converge to a Pareto optimal equilibrium. It is interesting that in proposed mechanism, the market is cleared by a simultaneous lowering of the “expectations” of bidders and raising of the auctioneer's “expectation.” At equilibrium, there are no coalitions that can improve the auctioneer's and bidders' utility simultaneously. Therefore, we call the mechanism the Pareto optimal auction. Besides, the proposed mechanism, consisting of four steps, is quite easy and simple to use by players and more practical to future commercial applications.The second issue concerns the existence of equilibrium in the Pareto optimal auction. For practical use, we first examine the discrete market where the bid price changes discretely. Under the constraint of individual rationality, the discrete market converges to a discrete Pareto optimal equilibrium in a finite number of periods. For the sake of comparison with the discrete market, we then discuss the existence of Pareto optimal equilibrium in the continuous market where the bid price changes continuously. Surprisingly, the existence of equilibrium in the discrete market provides a proof of equilibrium existence in the continuous market.The third issue is the uniqueness of equilibrium in the Pareto optimal auction. In the two-side market, there are often multiple equilibria in Gul and Stacchetti [32], which makes equilibrium depend on the choice of price adjustment process. In case of a discrete market with no ties, we prove that the Pareto optimal auction converges to a unique strong Pareto optimal equilibrium.The paper proceeds as follows. Section2 describes the model. Section 3 designs the Pareto optimal auction mechanism and examines the existence and uniqueness of its equilibrium. Section 4 concludes this paper.


## 2. The Model

Suppose there arem indivisible carbon emission rights and n bidders indexed by i
=
1,2
,
…
,
m and j
=
1,2
,
…
,
n, respectively. The carbon emission rights are assigned by the auctioneer to the bidders who want to purchase a given quantity of carbon emission rights. The auctioneer's utility and bidders' profit are realized across carbon emission rights transfer. If bidder j wins right i at the bid price of b
i
j, the utility of the auctioneer consists of the bid price and the environmental benefit:
(1)
u
i
j
=
a
i
j
+
b
i
j
,
where u
i
j is the utility function and a
i
j the cost to protect the environment; the jth bidder's profit is
(2)
v
i
j
=
p
i
j
-
b
i
j
,
where v
i
j is the jth bidder's profit and p
i
j the productivity of right i to bidder j. (In reality, the environmental benefit is endogenously determined by the whole economy. Therefore, the product functions of bidders (e.g., f
j
(
i
)) should be given. In this paper, we assume that the environmental benefit and the productivity of emission right are independent. However, doing so is without loss of generality, because all lemmas and theorems still hold with f
j
(
i
) replacing of p
i
j. Here, to simplify notations, we choose p
i
j.) It is further assumed that a
i
j
+
p
i
j
≥
0 for all (
i
,
j
). This assumption guarantees the utility gains for either the bidder or the auctioneer; otherwise the auction would be aborted. The utility or profit of doing nothing is normalized as zero. Let b
i
j
(
t
) be the bid price that the jth bidder is permitted to make to the ith right at time t.In the discrete case, we assume thata
i
j, p
i
j, and b
i
j
(
t
) are integers, which can be satisfied for the sufficiently small unit of measurement. The continuous case will be theoretically analyzed later by making use of the results in the discrete case. It is natural to assume that bidders buy many carbon emission rights and that each right is assigned only to one bidder. For notational simplicity, we assume that each bidder wants exactly to buy one right and each right is assigned exactly to one bidder. However, the arguments here can be extended to the general case almost without modification.In general,m
<
n. For the convenience of the following passage, the dummy carbon emission rights are introduced to make m
=
n. Since the dummy rights make no contribution to productivity, their bid prices are null. It immediately follows that the assignment rule ϕ
:
{
1,2
,
…
,
n
}
→
{
1,2
,
…
,
n
} is a one-to-one function, where ϕ
(
i
) is the bidder to whom the ith right is assigned. Surely, assignment rule ϕ is reversible: ϕ
-
1
(
·
)
=
ψ
(
·
), where ψ
(
j
) is the right assigned to the jth bidder. The auction outcome consists of assignment rule ϕ and bid prices (
b
1
ϕ
(
1
)
,
b
2
ϕ
(
2
)
,
…
,
b
n
ϕ
(
n
)
).In an exchange economy, the equilibrium under the perfect information requires that no coalitions are able to obtain mutual benefit, compared to current matched combination. Correspondingly, the assignment coincides with the Pareto optimal allocation as in Mas-Colell et al. [33, page 522]. To preserve the property of Pareto efficiency, we refer to the present notion as the Pareto optimal allocation in the auction studied below. Actually, it is useful to distinguish between the allocation in discrete market and that in the continuous market. These conditions motivate the following definitions.Definition 1.
An allocation(
ϕ
;
b
1
ϕ
(
1
)
,
b
2
ϕ
(
2
)
,
…
,
b
n
ϕ
(
n
)
) is individually rational, if the assignment of carbon emission rights to bidders together with the bid price vector are such that
(3)
a
i
ϕ
(
i
)
+
b
i
ϕ
(
i
)
≥
0
∀
i
,
p
ψ
(
j
)
j
-
b
ψ
(
j
)
j
≥
0
∀
j
.Definition1 is a participating constraint. It makes each bidder not worse than doing nothing and the auctioneer willing to sell off each right at given its bid price.Definition 2.
An individually rational allocation(
ϕ
;
b
1
ϕ
(
1
)
,
b
2
ϕ
(
2
)
,
…
,
b
n
ϕ
(
n
)
) is (discrete) strong Pareto optimal, if there is no right-bidder coalition (
i
,
j
) and (integer) bid price b such that
(4)
a
i
j
+
b
≥
a
i
ϕ
(
i
)
+
b
i
ϕ
(
i
)
,
p
i
j
-
b
≥
p
ψ
(
j
)
j
-
b
ψ
(
j
)
j
,
with strict inequality holding for at least one of (4). An individually rational allocation (
ϕ
;
b
1
ϕ
(
1
)
,
b
2
ϕ
(
2
)
,
…
,
b
n
ϕ
(
n
)
) is (discrete) Pareto optimal, if there is no right-bidder coalition (
i
,
j
) and (integer) bid price b that satisfy both (4) with strict inequality.Definition 3.
A carbon emission righti is said to be b
j-feasible for bidder j, if there is some discrete Pareto optimal allocation that assigns right i to bidder j at bid price b
j.Coalition in Definitions2 and 3 is said to be capable of improving upon the given allocation. It is clear from the above definitions that a strong Pareto optimal allocation is a Pareto optimal allocation. Further, it is easy to see that a (strong) Pareto optimal allocation of a continuous market at which bid prices satisfy the appropriate integer restrictions is also a (strong) Pareto optimal allocation of the corresponding discrete market. Thus, in a Pareto optimal allocation, the total utility of both the auctioneer and the bidders from all rights is maximized.


## 3. The Pareto Optimal Auction Mechanism

In this section, we first design the auction rules as simple as possible and call it the Pareto optimal auction mechanism because the auction converges to a Pareto optimal equilibrium (this will be checked in Theorems6 and 7). For both commercial application and theoretical completeness, equilibrium existence under the proposed auction is then examined when bid prices change discretely and continuously, respectively. Finally, equilibrium uniqueness and assignment efficiency are analyzed with no-tie constraint.Consider the following auction, defined for a discrete market on the matrix of integer bid prices[
b
i
j
(
t
)
], where time t is measured discretely.Step 1.
The auctioneer announces an initial price matrix[
b
i
j
(
0
)
=
-
a
i
j
] for all (
i
,
j
). Let t
:
=
0 and go to Step 2.Step 2.
Given the matrix of permitted prices[
b
i
j
(
t
)
], each bidder makes bids to her favorite carbon emission rights. For example, bidder j makes a bid to right i, where i is a solution of the problem
(5)
max
⁡
h
{
p
h
j
-
b
h
j
(
t
)
}
.
The right which receives more bids rejects all but the auctioneer's favorite one, taking into account environmental benefit and bid prices. However, bidders and the auctioneer may break ties at any time they like. For the right which receives only one bid, no rejection happens. As the auction continues, those bids not rejected in previous periods remain constant. Otherwise, the auction goes to Step 3.Step 3.
If the auctioneer rejects a bid from bidderj in period t
-
1, b
i
j
(
t
)
=
b
i
j
(
t
-
1
)
+
1. Rejected bidders continue to make bids to their favorite rights based on (5), taking into account their current permitted prices.Lemma 4.
Each carbon emission right receives at least one bid during the whole period of the auction.Proof.
For any carbon emission righti, since p
i
j
-
b
i
j
(
0
)
=
p
i
j
+
a
i
j
≥
0 for all j, bidders are willing to make bids to all carbon emission rights at the beginning of the auction. Suppose that carbon emission right i receives one bid b
i
j
(
0
) from bidder j at t
=
0. There are only two situations for the auctioneer. One is that the bid b
i
j
(
0
) is not rejected until the auction ends. The other is that in some period t, the bid b
i
j
(
0
) is rejected by the auctioneer. The only reason is that at time t another bid from some bidder k is made at b
i
k such that
(6)
a
i
j
+
b
i
j
(
0
)
≤
a
i
k
+
b
i
k
(
t
)
,
where by Step 3  i is a solution of (5) at t for bidder k. Thus, right i has the bid from bidder k instead of the one from bidder j. In a word, right i receives at least one bid during the whole period of the auction.Step 4.
Repeating Steps2 and 3, the auction ends until the period when no rejections are issued. The auctioneer accepts the bids from the bidders who have not been rejected.Lemma 5.
The auction ends after a finite number of periods and each (real or dummy) carbon emission right gets exactly one bid.Proof.
By Lemma4, each right gets at least one bid at any time t
≥
0. If at time t right i receives more than one bids, b
i
k
1
,
b
i
k
2
,
…
,
b
i
k
s, it must be true that for the auctioneer,
(7)
a
i
k
1
+
b
i
k
1
(
t
)
=
a
i
k
2
+
b
i
k
2
(
t
)
=
⋯
=
a
i
k
s
+
b
i
k
s
(
t
)
.
Otherwise, the auctioneer will choose her favorite one, taking environmental benefit and bid prices into account. By Step 2, without loss of generality, we suppose that at time t
′
≥
t, the auctioneer breaks the tie by rejecting all but bidder k
1. Then, the permitted bid prices at time t
′
+
1 are b
i
k
2
(
t
′
+
1
)
=
b
i
k
2
(
t
)
+
1
,
…
,
b
i
k
s
(
t
′
+
1
)
=
b
i
k
s
(
t
)
+
1. Repeating the above argument and noting that p
i
j is finite for all j, bidding competition must fall, in finite time, to the point where right i gets exactly one bid and no rejections are issued.
Because of the arbitrariness of righti and Step 2, each carbon emission right gets exactly one bid after a finite number of periods, no rejections are issued and the auction then ends.Based on Lemmas4 and 5, we now establish the main theorems in this paper.Theorem 6.
The Pareto optimal auction with discrete bid prices converges to a discrete Pareto optimal equilibrium in a finite number of periods.Proof.
First, we prove that the proposed auction converges to an individually rational allocation in the discrete market. Lett
* be the time at which the auction ends. Since b
i
j
(
0
)
=
-
a
i
j for all (
i
,
j
) and b
i
j
(
t
) never falls by Step 2 and Step 3, it is immediate that
(8)
a
i
j
+
b
i
j
(
t
*
)
≥
0
∀
(
i
,
j
)
.
Thus, by Definition 1 we only need to prove that
(9)
p
i
j
-
b
i
j
(
t
*
)
≥
0
,
if bidder j wins carbon emission right i when the auction ends. Suppose that p
i
j
-
b
i
j
(
t
*
)
<
0. Then, winning right i makes bidder j worse than doing nothing. By (5) of Step 2, bidder j could not have made a bid at b
i
j
(
t
*
) to right i. Considering dummy carbon emission rights, Lemma 5 implies that every right gets exactly one bid at the auction end, and it follows that right i is not one that bidder j wins at t
*. Hence, if bidder j wins right i at t
*, we must have p
i
j
-
b
i
j
(
t
*
)
≥
0.
Second, we prove by way of contradiction that the proposed auction converges to a discrete Pareto optimal allocation in the discrete market. By Lemma5, in a finite number of periods the auction converges to an individually rational equilibrium denoted by (
ϕ
;
b
1
ϕ
(
1
)
,
b
2
ϕ
(
2
)
,
…
,
b
n
ϕ
(
n
)
). Suppose that (
ϕ
;
b
1
ϕ
(
1
)
,
b
2
ϕ
(
2
)
,
…
,
b
n
ϕ
(
n
)
) is not a discrete Pareto optimal allocation. By Definition 2, there must exist a right-bidder coalition (
i
,
j
) and an integer bid price b such that
(10)
a
i
j
+
b
>
a
i
ϕ
(
i
)
+
b
i
ϕ
(
i
)
,
(11)
p
i
j
-
b
>
p
ψ
(
j
)
j
-
b
ψ
(
j
)
j
.
For any integer b satisfying (11), bidder j must make a bid to right i (i
≠
ψ
(
j
)) at b by (5). Because of i
≠
ψ
(
j
), the bid by Step 3 must have been rejected by the auctioneer. Since the auctioneer never rejects those bids that are at least as good as current accepted bids, right i’s equilibrium bid from bidder ϕ
(
i
) at b
i
ϕ
(
i
) must satisfy
(12)
a
i
ϕ
(
i
)
+
b
i
ϕ
(
i
)
≥
a
i
j
+
b
.
Inequality (12) contradicts (10), and thus Theorem 6 holds.In practice, for the sufficiently small money unit, say penny, Theorem6 ensures that the allocation is Pareto efficient in the proposed auction. Our discussion has been confined so far to discrete markets. Since small changes in other rights' bids can induce large changes in the adjustments a right's permitted bid price must undergone, it would be of interest to know, for the sake of comparison with the discrete market, what the continuous market implies about the existence of the Pareto optimal allocation. Perhaps somewhat surprisingly, the existence of Pareto optimal allocation in the discrete market allows a proof of the existence of a strong Pareto optimal allocation in the continuous market, as we now argue.Theorem 7.
The Pareto optimal auction with continuous bid prices has a strong Pareto optimal equilibrium.Proof.
By way of contradiction, suppose that the proposed auction with continuous bid prices has no strong Pareto optimal equilibria. Considering its individually rational allocation(
ϕ
;
b
1
ϕ
(
1
)
,
b
2
ϕ
(
2
)
,
…
,
b
n
ϕ
(
n
)
), let
(13)
g
[
(
i
,
j
)
;
ϕ
;
b
1
ϕ
(
1
)
,
b
2
ϕ
(
2
)
,
…
,
b
n
ϕ
(
n
)
]
=
a
i
j
+
p
i
j
-
(
a
i
ϕ
(
i
)
+
b
i
ϕ
(
i
)
)
-
(
p
ψ
(
j
)
j
-
b
ψ
(
j
)
j
)
.
In other words, g
(
·
) is the potential gain realizable by the right-bidder coalition (
i
,
j
) and price p
i
j improving upon allocation (
ϕ
;
b
1
ϕ
(
1
)
,
b
2
ϕ
(
2
)
,
…
,
b
n
ϕ
(
n
)
). Define
(14)
G
(
ϕ
;
b
1
ϕ
(
1
)
,
b
2
ϕ
(
2
)
,
…
,
b
n
ϕ
(
n
)
)
=
max
⁡
(
i
,
j
)
g
[
(
i
,
j
)
;
ϕ
;
b
1
ϕ
(
1
)
,
b
2
ϕ
(
2
)
,
…
,
b
n
ϕ
(
n
)
]
.
By the assumption and Definition 2, G
(
ϕ
;
b
1
ϕ
(
1
)
,
b
2
ϕ
(
2
)
,
…
,
b
n
ϕ
(
n
)
)
>
0; otherwise no right-bidder coalitions could improve upon that allocation.
We are going to show thatG
(
ϕ
;
b
1
ϕ
(
1
)
,
b
2
ϕ
(
2
)
,
…
,
b
n
ϕ
(
n
)
) has a positive lower bound for all individually rational assignment ϕ. Let
(15)
l
(
ϕ
)
=
min
⁡
(
b
1
ϕ
(
1
)
,
b
2
ϕ
(
2
)
,
…
,
b
n
ϕ
(
n
)
)
G
(
ϕ
;
b
1
ϕ
(
1
)
,
b
2
ϕ
(
2
)
,
…
,
b
n
ϕ
(
n
)
)
.
Since a
i
j
+
p
i
j
≥
0 and -
a
i
j
≤
b
i
j
(
t
)
≤
p
i
j for all (
i
,
j
), the feasible region of (15) is a nonempty, bounded, and closed set. For given ϕ, G
(
·
) is continuous in (
b
1
ϕ
(
1
)
,
b
2
ϕ
(
2
)
,
…
,
b
n
ϕ
(
n
)
) by the fact that the maximum of continuous functions is continuous. Therefore, l
(
ϕ
)
>
0 for given ϕ. Define
(16)
L
=
min
⁡
ϕ
∈
Φ
l
(
ϕ
)
,
where Φ is the set of all one-to-one functions ϕ
:
{
1,2
,
…
,
n
}
→
{
1,2
,
…
,
n
}. Since Φ is a finite set, it immediately follows that L is strictly positive and that G
(
ϕ
;
b
1
ϕ
(
1
)
,
b
2
ϕ
(
2
)
,
…
,
b
n
ϕ
(
n
)
)
≥
L
>
0.
Thus, for any individually rational allocation in the proposed auction with continuous bid prices, there is at least one bidder-right coalition improving upon the given allocation and potential gain is strictly positive. Note that an individually rational allocation of a continuous market at which bid prices satisfy the appropriate integer restrictions is also an individually rational allocation of the corresponding discrete market. The argument above implies that any individually rational allocation in the corresponding discrete market can also be improved upon by some bidder-right coalition and further that this discrete market has no Pareto optimal allocations, which contradicts Theorem6. Therefore, the Pareto optimal auction with continuous bid prices has a strong Pareto optimal equilibrium.The main interest of Theorems6 and 7 is that they lay the theoretical foundation for the existence of Pareto optimal allocations. From Step 1 to Step 4, the Pareto optimal auction can be viewed as an algorithm for computing optimal assignments. In particular, for the appropriate choice of the unit of measurement (calculable in advance if, e.g., a
i
j and p
i
j are known to be integers), our auction converges in finite time to a Pareto optimal allocation with assignment rule ϕ. This is associated with the strong Pareto optimal allocation in the continuous market.The effectiveness of the auction can be improved if Step2 is modified as follows: at each time, every bidder can only choose one right from her favorite rights and the auctioneer can only choose one bid from more bids to right i. In other words, there are no ties in each period of the auction. Thus, given bid prices matrix [
b
i
j
(
t
)
], u
i
j
≠
u
i
k if j
≠
k and v
i
j
≠
v
h
j if i
≠
h.Lemma 8.
In the Pareto optimal auction with no ties, the (discrete) strong Pareto optimal allocation coincides with the (discrete) Pareto optimal allocation.Proof.
The asymmetry between bidders and the auctioneer arises only because bidders make bids in the auction. Where bidders and rights interchanged everywhere in the auction, all results with bidders and the auctioneer interchanged would also be true. Thus, if either of (4) holds, the other must also hold. With no ties, the (discrete) strong Pareto optimal allocation makes no difference from the (discrete) Pareto optimal allocation in the Pareto optimal auction.We now turn to the question whether the result in Theorem6 remains valid when there are no ties. For the discrete market, the answer is yes, as shown by the following theorem.Theorem 9.
(i) In a discrete market with no ties, the proposed auction converges to a discrete strong Pareto optimal allocation.
(ii) That allocation for every bidder is at least as good as any other discrete strong Pareto optimal allocation of the discrete market.
(iii) That allocation for the auctioneer is at least as good as any other discrete strong Pareto optimal allocation of the discrete market.Proof.
(i) If no ties occur, it suffices to consider the discrete Pareto optimal allocation by Lemma8. Theorem 6 implies that (i) holds.
(ii) Suppose that the auctioneer rejects a bid to righti from bidder j at b
j in favor of a bid from bidder k at b
k. We will prove that right i is not b
j-feasible for bidder j.
As ties have been ruled out, Step2 implies that
(17)
a
i
k
+
b
k
>
a
i
j
+
b
j
.
Further, by (5), right i at b
k is better for bidder k than any other right at current permitted bid prices. Thus, if h
≠
i,
(18)
p
i
k
-
b
k
>
p
h
k
-
b
′
,
where b
′ is current bid price that bidder k is permitted to make to right h.
Consider an allocation that assigns righti to bidder j at b
j and all other rights to bidders at the feasible bid prices. By (17) and (18), the auctioneer and bidder k both prefer each other at integer bid price b
k to such an allocation. Hence, it is not a discrete Pareto optimal allocation, and further right i is not b
j-feasible for bidder j.
The above argument shows that in the auction, no bidders are ever rejected by the auctioneer at theb-feasible bid price for bidder j. By Definition 3, the allocation in (i) is b-feasible for every bidder. Thus, the auctioneer accepts the allocation outcome in (i). From the fact that bidders make bids to their favorite rights first, it therefore follows that bidders unanimously prefer the discrete Pareto optimal allocation in the proposed auction to any other discrete Pareto optimal allocation in the discrete market.
(iii) The proof of Lemma8 demonstrates that all results will also be true with bidders and the auctioneer interchanged. From (ii), we immediately get (iii).Theorem9 implies that the Pareto optimal auction is not only efficient for bidders (because it maximizes bidders’ profit), but also optimal for the auctioneer (because the final assignment outcome maximizes the auctioneer's utility). In this sense, our auction mechanism solves the open question of the conflict between efficiency and revenue in multi-item auctions left by Milgrom [14].Theorem 10.
In a discrete market with no ties, the proposed auction converges to unique discrete strong Pareto efficient allocation.Proof.
Suppose there are two discrete strong Pareto optimal allocations in a discrete market with no ties:(
ϕ
1
;
b
1
ϕ
1
(
1
)
,
b
2
ϕ
1
(
2
)
,
…
,
b
n
ϕ
1
(
n
)
) and (
ϕ
2
;
b
1
ϕ
2
(
1
)
,
b
2
ϕ
2
(
2
)
,
…
,
b
n
ϕ
2
(
n
)
); we are going to prove these two allocations are the same. For bidders, Theorem 9 (ii) implies that v
ψ
1
(
j
)
j
≥
v
ψ
2
(
j
)
j and v
ψ
1
(
j
)
j
≤
v
ψ
2
(
j
)
j, where ψ
1
=
ϕ
1
-
1 and ψ
2
=
ϕ
2
-
1, and thus v
ψ
1
(
j
)
j
=
v
ψ
2
(
j
)
j. Further, the no ties condition implies ψ
1
=
ψ
2, and thus ϕ
1
=
ϕ
2. Similarly, for the auctioneer, by Theorem 9 (iii) we have a
i
ϕ
1
(
i
)
+
b
i
ϕ
1
(
i
)
=
u
i
ϕ
1
(
i
)
=
u
i
ϕ
2
(
i
)
=
a
i
ϕ
2
(
i
)
+
b
i
ϕ
2
(
i
). Noted that a
i
ϕ
1
(
i
)
=
a
i
ϕ
1
(
i
) for all i by ϕ
1
=
ϕ
2, it follows that b
i
ϕ
1
(
i
)
=
b
i
ϕ
2
(
i
) and that (
ϕ
1
;
b
1
ϕ
1
(
1
)
,
b
2
ϕ
1
(
2
)
,
…
,
b
n
ϕ
1
(
n
)
) and (
ϕ
2
;
b
1
ϕ
2
(
1
)
,
b
2
ϕ
2
(
2
)
,
…
,
b
n
ϕ
2
(
n
)
) are the same. Thus, the proposed auction converges to unique discrete strong Pareto efficient allocation in a discrete market with no ties.It is often of great interest to ask whether an economic system is producing an “optimal” economic outcome. In our proposed auction, Theorem10 shows that the answer is yes in the sense that at equilibrium, there is no such an alternative way to redistribute carbon emission rights that makes some agent (auctioneer or bidder) better off without making some other agent worse off. Therefore, the allocation that is Pareto optimal (or Pareto efficient) uses carbon emission rights' resources efficiently.


## 4. Conclusion

Relatively to ordinary tradable goods and services, carbon emission rights have own unique features, such as the positive externality, a limited duration of validity, the effects of industrial structure, and the necessary input factor for the product process using carbon-based energy as fuel. Such features make carbon emission rights do not fit equally well into the existing framework of the auction mechanisms for ordinary multiple items. However, the existing literature, on carbon emission rights auctions, focuses on the emission reduction effectiveness and policy performance of EU ETS, leaving open associated auction mechanism design and equilibrium discussion. Thus, the auction mechanism research on carbon emission rights seriously lags behind the practice. To fill in the gap in terms of theoretical research, this paper develops a new auction mechanism for carbon emission rights by making use of the Pareto optimal concept. The result shows there exists a Pareto optimal auction equilibrium and under the condition without ties, the equilibrium is unique and efficient. The efficiency of auction mechanism is of great significance to meet the carbon emission reduction cap at the lower economic costs. In addition, the proposed mechanism consists of four steps, so it is simple to understand and easy to use, which makes it possible for future commercial applications.Typically, to future commercial applications, the paper considers the case where the price adjustment is discrete; to theoretical completeness, the continuous situation is also analyzed. Within the proposed auction mechanism, it is found that there are a Pareto optimal equilibrium and a Pareto efficient assignment for both the discrete and continuous markets. With no-tie restriction, the Pareto optimal equilibrium and then the Pareto efficient allocation are unique in the discrete market.Several interesting problems remain for future research in this paper. The first one is how to generalize the proposed auction to the general situation when the bidders' and the auctioneer's payoffs are nonlinear in bid prices. Another one concerns the tatonnement process which has been widely debated in economics. Since the existence and uniqueness of equilibrium for a tatonnement process are dependent on the special supply and demand functions, what the decision functions are if the bidders are heterogenous or having a more general utility function? The third one is how environmental benefit is endogenously determined by the whole economy and entered into the product functions of the bidders. The last one generalizes our mechanism to the case dynamic situation similar to Huang et al. [34].



---

*Source: 438104-2014-03-30.xml*