Fair Optimization and Networks: Models, Algorithms, and ApplicationsView this Special Issue
Research Article | Open Access
Price of Fairness on Networked Auctions
We consider an auction design problem under network flow constraints. We focus on pricing mechanisms that provide fair solutions, where fairness is defined in absolute and relative terms. The absolute fairness is equivalent to “no individual losses” assumption. The relative fairness can be verbalized as follows: no agent can be treated worse than any other in similar circumstances. Ensuring the fairness conditions makes only part of the social welfare available in the auction to be distributed on pure market rules. The rest of welfare must be distributed without market rules and constitutes the so-called price of fairness. We prove that there exists the minimum of price of fairness and that it is achieved when uniform unconstrained market price is used as the base price. The price of fairness takes into account costs of forced offers and compensations for lost profits. The final payments can be different than locational marginal pricing. That means that the widely applied locational marginal pricing mechanism does not in general minimize the price of fairness.
Classical auction (through the whole paper by “auction” we mean closed double sealed exchange-like mechanism; in other words an “auction” is a set of trading rules for an exchange) mechanisms are based on the supply/demand curves intersection which sets accepted and rejected offers and determines the uniform market price. However, in many real-world infrastructure economies, a commodity flow is limited by the resources of some network system. This leads to a concept of the networked auctions . Some examples come from electricity , gas [3, 4], water , telecommunication , and transport markets. Determination of auction winners not only must be based on economic grounds, but also must be aligned with network system resources, for example, transmission grid, water transmission network, telecommunication network, and road network resources.
In  the network winner determination problem (NWDP), an extension of classical winner determination problem (WDP) with consideration of network resources, has been introduced. This model solves only the problem of social welfare maximization, but there is still the question of how social welfare should be distributed between the market participants. In classical auctions, the marginal pricing principle is usually applied, which provides the solution acknowledged to be fair. In case of networked auctions the fairness conditions can be disrupted and uniform market pricing cannot be used.
To address fairness in the electricity markets, the locational marginal pricing (LMP) was introduced by Schweppe  and further developed by Hogan . LMP sets the marginal prices at each node. Although this approach is widely recognized in a context of electricity markets, the LMP and similar marginal nodal pricing policies are also addressed for other markets [3, 5, 9]. The LMP has several flaws . One of the main shortcomings is only partial distribution of social welfare between market participants. This means that there is some price that is paid to restore the fairness conditions.
In this paper we introduce the price of fairness (PoF) for networked auctions. We focus on multicommodity sealed-bids auctions. Our main theorem proves that the minimal PoF can be achieved if the unconstrained market price is used for settlements and some additional nodal components are paid at each node. This means that widely used locational marginal pricing approach does not minimize the PoF. Till now, there is very little literature devoted to fair networked auctions, and business is focused on LMP-like mechanisms. We think that our main result is to show that there is a wide interesting spectrum of fair auction mechanisms for networked systems. This spectrum should be further investigated including also aspects other than the PoF.
The paper is organised as follows. A discussion of related works is provided in Section 2. In Section 3, we introduce basic notions: the general model of networked auction with its components (a special case of winner determination problem and value mechanism) and the problem of finding the best value mechanism. The concept of fairness in the context of networked auction is introduced in Section 4. The main results of the paper are presented in Section 5. We define the price of fairness and analyze it in the space of possible value mechanisms. We conclude and present some interesting future directions in Section 6.
2. Related Literature
The concept of fairness plays an important role in resource allocation problems [11–13]. Although fairness is a subjective notion, it implies equity and impartiality . To achieve these conditions several ways of specifying the fairness are considered in the literature. Usually, some measure of inequality is to be minimized [15, 16]. The simplest measures are based on the absolute measurement of the spread of outcomes, for example, mean or maximum absolute difference, or measurement relative to the mean outcome, for example, mean absolute deviation or Gini coefficients [17, 18]. Unfortunately, direct minimization of typical inequality measures is in contradiction with optimization of individual outcomes . One can use an aggregation function to solve the problem; however this function should satisfy several requirements . Various solution concepts can be achieved when logarithmic function is used to obtain fair aggregation . The concept of equitably efficient solution is another approach, which was formalized in .
Unfortunately, all of these concepts of fairness and their underlying axiomatisation cannot be applied directly when the allocation is performed via auction mechanism. In this case, the fairness concept must take into consideration the prices of bids and thus different utility of bidders. Moreover, the incompleteness of information possessed by each bidder is also important.
Auction has been widely considered as a mechanism of resource allocation in selfish, multiagents environments . Although the theoretical literature on auctions is rich and multidimensional, fairness issues are relatively rare. In , two notions of fairness are introduced for combinatorial auctions: the basic fairness and the extended fairness. The basic fairness is related to conditions that must be satisfied to leave each agent with the feeling that he has a fair share. The extended fairness ensures envy-free allocation, which means that each agent is at least as happy with his share as he would be with share of any other agent.
Murillo et al.  consider a recurrent auction model equipped with reservation price. In this setting, no selling offer below its reservation price can be winning. The incorporation of the reservation price forces the introduction of fairness considerations. The problem considered in  is a policy of setting the reservation prices to assure fairness condition understood as a similar probability of winning for every bidder.
Wu et al.  consider fairness in the sealed-bid auctions rather more on procedural level than the market clearing rules. In order to mitigate the possibilities for collusion or cheating, they consider when and how the sealed bids should be opened.
The term price of fairness has been introduced in . In this work, the PoF has been analyzed in the context of general resource allocation problem. The authors define PoF as a relative system efficiency loss under fair conditions of the allocation. A characterization of the PoF for a broad spectrum of allocation problems is also provided in .
There are also some studies, that refer to the PoF indirectly; They consider loss of efficiency due to fair conditions, mainly in allocation problems. In most works, the price of fairness or similar notion is defined as the performance loss incurred relative to utility, in making allocations under one of several possible fairness criteria formulations. In  some numerical computations for efficiency loss in several network configurations are presented under consideration of proportional and max-min fairness. Butler and Williams have proved that, for certain class of facility location problem, the price of fairness is zero . Mo and Walrand have studied some family of parameterised objective of bandwidth allocations . The max-min fairness and proportional fairness are special cases of this family.
In  the fairness is defined by a set of requirements that must be satisfied in a fair solution of auction with uniform pricing. In our paper we follow this work and extend the analysis to the case of nodal pricing. Differentiation of buy and sell market prices is discussed in  with an application to electricity market. We derive the concept of separated prices for buying and selling from this work. However, we consider more general class of auction models.
The price of anarchy is somehow similar concept to the PoF [32, 33]. It measures the system efficiency loss due to selfish behaviour of the agents. The PoA and PoF are only partially overlapped. Even if the agents would play truly, the PoF can be positive. However, the increase of PoA can be related to higher PoF that results from deficiency of considered auction mechanism.
3. Networked Auctions
We consider an organized market in which the sellers and buyers submit their offers. Then, the auction mechanism is run to find the winning offers and to set the value flows. The auction rules can be divided into two steps: the winners determination and the pricing.
3.1. Winners Determination Problem
Let us assume that an infrastructure network is modeled by graph , where is a set of vertices and is a set of edges . We assume that graph is defined by an incidence matrix . To make the notation simpler, we also assume that is a connected graph. Any solution to the winners determination problem is equivalent to some flows in the and must satisfy Kirchoff’s laws. Each sell offer is related to a commodity that can be injected by a seller into the network at a given node. Similarly, any buy offer is related to a commodity that can be taken by a buyer from the network at a given node.
Definition 1 (vertex-oriented network winner determination problem, VWDP). The sellers submit the set of offers . An offer is a tuple , where is an offered unit price, and is the maximal offered volume of a commodity. The buyers submit a set of offers . An offer is a tuple , where is an offered unit price, and is the maximal demanded volume of a commodity. Without loss of generality, to simplify the notation, we assume that each seller and each buyer are located in different node. Thus, the indexes of sellers and buyers can be also used for indexing the nodes. Let be a set of seller nodes and let be a set of buyer nodes. The vertex-oriented network winner determination problem (VWDP) is to find a set of winning offers and their volumes and , and , which is balanced () and social welfare-maximizing under the network flow constraints: where is the commodity flow over edge and and are the accepted volumes of sell offer and buy offer , respectively. The VWDP maximizes the natural utilitarian criterion—the sum of the surpluses of all individual players. Full formulation of VWDP is a simple extension of classical auction models  and can be expressed as linear programme.
3.2. Value Mechanism
The maximal total social welfare is achieved by solving VWDP. The buyers and sellers are selfish and tend to maximize their individual profits. Thus, we should notice that the submitted offers could be different than the market participants’ true valuations, and then would not be a true social welfare, but rather “declared” market surplus .
The value mechanism is responsible for the surplus distribution. The distribution is usually expressed with the use of payment information , which may include market price, payments for individual offers, and other information. For instance, there are marginal prices at each node in in case of LMP mechanism. The mechanism is defined as the following mapping:
A very generic approach to modeling the value mechanisms was formulated by Toczyłowski and called parametric balancing model . It introduces a virtual node denoted by 0 and connected to each other node. There are market price at virtual node and nodal prices at every node in . If commodity is injected to the network at node and is the nodal price, then is the unit cost of commodity transport from node to the virtual node . Similarly, if node is a consumption node with nodal price then is the unit cost for commodity transport from the virtual node 0 to node (see Figure 1).
3.3. Problem of Finding the Best Value Mechanism
Let us assume that there is a set of quality measures of pricing mechanisms, where function is such that if , then mechanism is strictly preferred over the mechanism according to the measure . Quality measures introduce the partial order to the space of mechanisms. Then, the problem of finding the best mechanism is defined as follows:
For a given pricing mechanism it is interesting whether it is nondominated solution of multicriteria problem (3). In the next sections we will formulate a bit narrower space of possible mechanisms and we will analyze possible pricing mechanisms according to the PoF criterion.
4. Concept of Fairness
For a given set of nodal prices the set of offers can be divided into competitive and noncompetitive subsets. A sell (buy) offer at node is competitive if nodal price is higher/lower than or equal to the offer price, that is, if . An offer is strictly competitive if or . A sell (buy) offer is considered to be noncompetitive offer if the nodal price is lower/higher than the offer price, that is, if . If an accepted (fully or partially) offer is also noncompetitive offer then it is called forced offer.
Two notions of fairness have been introduced in : absolute fairness and relative fairness.
4.1. Absolute Fairness
Fairness in absolute sense means that no offer brings individual loss. Figure 2 illustrates an accepted (forced) sell offer . Since the seller is paid with nodal price lower than the offer price , the entity gains loss . To compensate the loss, the cost of forced sell must be also paid to the seller . Of course, if it is possible to set nodal prices, that make each offer competitive, then no individual losses appear. A mechanism can ensure no individual losses either by directly setting prices or by additional payment of losses compensation .
Similarly, the compensation of competitive buyer losses should be introduced. For forced buy offer the compensation is . According to the concept of fairness introduced in , a mechanism is fair in absolute sense if it ensures no individual losses.
4.2. Relative Fairness
Mechanism is fair in the relative sense if none of the parties can claim to be treated worse than others. This means that each strictly competitive offer must be fully accepted. For instance, a seller can claim to be treated clearly unfair if his offer price is lower than market nodal price, but his offer is not winning. If such situation cannot be avoided, the compensations for the loss of profit should be introduced. Figure 3 illustrates the compensation for a sell offer which is . Similarly, the compensation for uncompetitive buy offer is defined as .
Also, two participants connected with undersaturated edge should have the same nodal prices. If this would not be satisfied, then the entity with the worse nodal price could trade in the neighbor’s node with better profits.
A mechanism is fair if it satisfies fairness conditions in absolute and relative senses.
5. Analysis of Fairness
5.1. Price of Fairness
Let be the social welfare resulting from the optimal solution of VWDP. Let be a mechanism that satisfies absolute and relative fairness conditions. The mechanism produces some welfare distribution. Some part of the social welfare is distributed under pure market rules. The sellers obtain and the buyers gain . Some part of the social welfare is also distributed via lost profit compensations: and . Finally, some social welfare may be not distributed and market becomes imbalanced.
The difference between total social welfare and welfare distributed under the pure market rules is a price that must be paid to maintain fairness . It can be partially paid as the compensations or it becomes an unbalanced value that should be allocated with some additional, not market, mechanism (like fees and subsidies). We call this difference the price of fairness (PoF).
5.2. Space of Value Mechanisms
Let , , , , , , , , . Let us define the space of value mechanisms as follows:
The space is quite general. It covers LMP mechanism ( and are marginal). Also the single uniform price model is in ( is uniform market price and , ).
Moreover, for the sake of generality, we also consider the mechanisms that, unlike the LMP or classical uniform pricing, assume two nodal market prices at each node: buying price and selling price . The idea of differentiation of sell and buy prices has been proposed in  and discussed in  in the context of balancing electrical energy market.
5.3. PoF Minimization
In the perfect situation, when no congestion manifests in the network, the maximal economic benefit can be reached, where and are the accepted volumes under neglected network constraints assumption. We will call the solution , of the VWDP with network constraints neglected the unconstrained solution. The related social welfare will be called the unconstrained welfare. In most cases, as a result of limited resources in the system, the loss of aggregated economic benefits is observed. We refer to the solution , as constrained solution for which constrained social welfare is obtained. Let be the total trade volume, .
Lemma 2. Price of fairness can be expressed as follows:
Proof. Market sell cost received by the sellers is
Market buy cost received by the buyers is
The basic balance is as follows: , where is an imbalance of the market. Thus , and after transformation , and after further simplifications .
Let us analyze the properties of . For given values of we obtain the market sell cost function of one variable . If is sufficiently small (i.e., it is below each of the offer prices), then the function is equal to some minimal value . Function increases with increase. is a continuous, convex function (the derivative of this function is equal to volume of sell offers and prices lower than ).
Similar analysis can be done for function . For given values of we obtain function , which for sufficiently big price , no less than the maximal offer price, is equal to sell value . When the value of goes down, the function becomes decreasing and its derivative is increasing. So, it is continuous, concave function.
Functions and are illustrated in Figure 4. It is easy to see from (5) and Figure 4 that, for given values and , the PoF function of market prices and is a convex function. Let us denote the value of market trade by for given values and .
Lemma 3. The PoF is a convex function with respect to the value of market trade .
Proof. The proof of convexity of function , without congestion costs, is provided in . For fixed congestion costs, that is, for given values of and , is a function of market trade value in the range and it is a convex function (see Figure 4).
Notice that above property is true for all values of and . Any change in values of results in parallel shift of the function by the value . Any change in values of results in parallel shift of function by . Due to market balance, any deviation in must be compensated by a change in ; thus is constant. Finally, any shift in must also result in the same shift in . For different prices and the gap between and is constant and does not change when the values and are changing. Therefore, is a convex function for any prices and .
Now, we will show that the minimum of PoF is reached for market price . First, in the following two lemmas we consider two cases: market price is lower than ; market price is greater than .
Lemma 4. The PoF for market price is lower than PoF for .
Proof. We assume that congestions involve some reduction of accepted volume of offers from set with total reduced volume . Because these offers would be accepted in the unconstrained market, their prices must be lower than . To meet the demand , the reduction must be compensated by some forced offers. Let us denote the set of these offers by . Their prices must be not lower than and their total volume is . Now, we will consider a decrease of market price by the value . It would decrease the compensations by the value , if is higher than for , or the decrease would be even smaller if some of the offers would become competitive. Total change of compensation is determined as follows:
The above expression can be also rewritten in the following form:
Decreasing the market price causes increase in costs of forced sell with value for and for and . Total change in the PoF is as follows:
Similar reasoning can be carried out for the buyers, showing that decreasing leads to increase of the PoF.
Lemma 5. The PoF for market price is lower than PoF for .
Proof. The proof is similar to the proof of the previous lemma. Let us assume that congestions cause the reduction of accepted volume of offers from the set with total volume . Because these offers would be accepted in the unconstrained market, their prices must be not higher than . To meet the demand , there must be also forced increase of other offers. Let us denote these offers by . Their prices must be not lower than and their total volume is . Increase of market price by value causes a compensation increase by value
The increase of market price causes the decrease cost of forced sell by The above expression can be also rewritten as follows:
Total change in PoF of balancing is as follows: Similar reasoning can be carried out for the buyers, showing that increasing leads to increase of the PoF.
Finally, we can formulate the theorem about the minimal PoF.
Theorem 6. The minimum of PoF is achieved at the market price at every node.
In the paper, we have introduced and analyzed the concept of price of fairness. PoF reflects the social welfare that must be distributed out of pure market mechanism to assure that the final distribution is fair according to the absolute and relative fairness definitions. Our main result is proving that the PoF is a convex function with respect to the market value . It means that there exists the unique minimum of PoF function. In fact, we have proved that the minimal PoF is achieved for theoretical uniform price coming from the unconstrained market solution. Instead of nodal marginality, the costs of forced offers and compensations of lost profits are paid. We observe that widely applied locational marginal pricing mechanism does not in general minimize the PoF.
Our results open the doors for further investigations of new mechanisms. We have shown that there is still a lot of space for new mechanisms that can be even better than locational marginal pricing, at least in some criteria, for example, PoF. We have introduced the space of mechanism , which is promising to contain new interesting mechanism designs. We believe that further researches should include more quality measures of mechanism, for example, efficiency market signals.
Conflict of Interests
The author declares that there is no conflict of interests regarding the publication of this paper.
- M. Kaleta, “Security constrained network winner determination problem,” in Automatyzacja Procesów Dyskretnych, Teoria i Zastosowania, A. Świerniak and J. Krystek, Eds., pp. 111–118, Wydawnictwo Pracowni Komputerowej Jacka Skalmierskiego, 2012.
- M. Kaleta and T. Traczyk, Modeling Multi-Commodity Trade: Information Exchange Methods, Advances in Intelligent and Soft Computing, Springer, 2012.
- H. Cremer and J. Laffont, “Competition in gas markets,” European Economic Review, vol. 46, no. 4-5, pp. 928–935, 2002.
- H. Cremer, F. Gasmi, and J. Laffont, “Access to pipelines in competitive gas markets,” Journal of Regulatory Economics, vol. 24, no. 1, pp. 5–33, 2003.
- A. Dinar, R. Howitt, S. Rassenti, and V. L. Smith, “Development of water markets using experimental economics,” in Markets for Water, K. Easter, M. Rosegrant, and A. Dinar, Eds., vol. 15 of Natural Resource Management and Policy, pp. 259–275, Springer, New York, NY, USA, 1998.
- P. Kacprzak, M. Kaleta, P. Pałka, K. Smolira, E. Toczyłowski, and T. Traczyk, “Application of open multi-commodity market data model on the communication bandwidth market,” Journal of Telecommunications and Information Technology, vol. 4, pp. 45–50, 2007.
- F. C. Schweppe, M. C. Caramanis, R. D. Tabors, and R. E. Bohn, Spot Pricing of Electricity, Kluwer Academic Publishers, New York, NY, USA, 1988.
- W. W. Hogan, “Contract networks for electric power transmission,” Journal of Regulatory Economics, vol. 4, no. 3, pp. 211–242, 1992.
- S. Lochner, “Identification of congestion and valuation of transport infrastructures in the European natural gas market,” Energy, vol. 36, no. 5, pp. 2483–2492, 2011.
- A. Rosenberg, “A proposed alternative to locational marginal pricing and its impact on new generation,” The Electricity Journal, vol. 17, no. 3, pp. 11–25, 2004.
- H. Luss, “On equitable resource allocation problems: a lexicographic minimax approach,” Operations Research, vol. 47, no. 3, pp. 361–378, 1999.
- W. Ogryczak, M. Pioro, and A. Tomaszewski, “Telecommunications network design and max-min optimization problems,” Journal of Telecommunications and Information Technology, vol. 4, pp. 43–53, 2005.
- H. Luss, Equitable Resource Allocation: Models, Algorithms and Applications, Information and Communic ation Technology Series, Wiley, 2012.
- H. P. Young, Equity: In Theory and Practice, Princeton University Press, 1995.
- A. B. Atkinson, “On the measurement of inequality,” Journal of Economic Theory, vol. 2, pp. 244–263, 1970.
- A. Sen, On Economic Inequality, Clarendon Paperbacks, Clarendon Press, 1973.
- W. Ogryczak, “Inequality measures and equitable locations,” Annals of Operations Research, vol. 167, pp. 61–86, 2009.
- O. Maimon, “The variance equity measure in locational decision theory,” Annals of Operations Research, vol. 6, no. 5, pp. 147–160, 1986.
- E. Erkut, “Inequality measures for location problems,” Location Science, vol. 1, no. 3, pp. 199–217, 1993.
- W. Ogryczak and T. Trzaskalik, “Equity, fairness and multicriteria optimization,” in Multiple Criteria Decision Making '05, pp. 185–199, Wydawnictwo Uczelniane AE Katowice, 2006.
- M. M. Kostreva and W. Ogryczak, “Linear optimization with multiple equitable criteria,” RAIRO Operations Research, vol. 33, no. 3, pp. 275–297, 1999.
- V. Krishna and V. Krishna, Auction Theory, Academic Press, 2002.
- S. Sudeendra, M. Saini, and S. Rao, “Fairness in combinatorial auctions,” CoRR abs/1005.4774, 2010.
- J. Murillo, B. López, V. Muñoz, and D. Busquets, “Fairness in recurrent auctions with competing markets and supply fluctuations,” Computational Intelligence, vol. 28, no. 1, pp. 24–50, 2012.
- C.-C. Wu, C.-C. Chang, and I.-C. Lin, “New sealed-bid electronic auction with fairness, security and efficiency,” Journal of Computer Science and Technology, vol. 23, no. 2, pp. 253–264, 2008.
- E. Toczyłowski, Optimization of Market Processes under Constraints, EXIT Academic Publishing, 2003, (Polish).
- D. Bertsimas, V. F. Farias, and N. Trichakis, “The price of fairness,” Operations Research, vol. 59, no. 1, pp. 17–31, 2011.
- T. Bonald and L. Massouli, “Impact of fairness on internet performance,” in Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS '01), pp. 82–91, ACM, New York, NY, USA, 2001.
- M. Butler and H. P. Williams, “Fairness versus efficiency in charging for the use of common facilities,” Journal of the Operational Research Society, vol. 53, no. 12, pp. 1324–1329, 2002.
- J. Mo and J. Walrand, “Fair end-to-end window-based congestion control,” IEEE/ACM Transactions on Networking, vol. 8, no. 5, pp. 556–567, 2000.
- E. Toczyłowski and I. Zoltowska, “A new pricing scheme for a multi-period pool-based electricity auction,” European Journal of Operational Research, vol. 197, no. 3, pp. 1051–1062, 2009.
- E. Koutsoupias and C. Papadimitriou, “Worst-case equilibria,” in Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, pp. 404–413, Trier, Germany, March 1999.
- C. Papadimitriou, “Algorithms, games, and the internet,” in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC '01), pp. 749–753, ACM Press, New York, NY, USA, 2001.
- M. Kaleta, “Computing alpha-efficient cost allocations for unbalanced games,” in Social Informatics, vol. 6430 of Lecture Notes in Computer Science, pp. 103–112, 2010.
Copyright © 2014 Mariusz Kaleta. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.