Optimal Pricing in Markets with Non-Convex Costs

Navid Azizan, Yu Su, Krishnamurthy Dvijotham, A. Wierman
{"title":"Optimal Pricing in Markets with Non-Convex Costs","authors":"Navid Azizan, Yu Su, Krishnamurthy Dvijotham, A. Wierman","doi":"10.2139/ssrn.3365416","DOIUrl":null,"url":null,"abstract":"We consider a market run by an operator who seeks to satisfy a given consumer demand for a commodity by purchasing the needed amount from a group of competing suppliers with non-convex cost functions. The operator knows the suppliers' cost functions and announces a price/payment function for each supplier, which determines the payment to that supplier for producing different quantities. Each supplier then makes an individual decision about how much to produce (and whether to participate at all), in order to maximize its own profit. The key question is how to design the price functions. This problem is relevant for many applications, including electricity markets. The main contribution of this paper is the introduction of a new pricing scheme, \\name (\\acr ) pricing, which is applicable to general non-convex costs, allows using general parametric price functions, and guarantees market clearing, revenue adequacy, and ecomonic efficiency while supporting comptitive euqilibrium. The name of this scheme stems from the fact that we directly impose all the equilibrium conditions as constraints in the optimization problem for finding the best allocations, as opposed to adjusting the prices later to make the allocations an equilibrium. While the optimization problem is, of course, non-convex, and non-convex problems are intractable in general, we present a tractable approximation algorithm for solving the proposed optimization problem. Our framework extends to the case of networked markets, which, to the best of our knowledge, has not been considered in previous work.","PeriodicalId":416173,"journal":{"name":"Proceedings of the 2019 ACM Conference on Economics and Computation","volume":"236 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2019 ACM Conference on Economics and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3365416","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

Abstract

We consider a market run by an operator who seeks to satisfy a given consumer demand for a commodity by purchasing the needed amount from a group of competing suppliers with non-convex cost functions. The operator knows the suppliers' cost functions and announces a price/payment function for each supplier, which determines the payment to that supplier for producing different quantities. Each supplier then makes an individual decision about how much to produce (and whether to participate at all), in order to maximize its own profit. The key question is how to design the price functions. This problem is relevant for many applications, including electricity markets. The main contribution of this paper is the introduction of a new pricing scheme, \name (\acr ) pricing, which is applicable to general non-convex costs, allows using general parametric price functions, and guarantees market clearing, revenue adequacy, and ecomonic efficiency while supporting comptitive euqilibrium. The name of this scheme stems from the fact that we directly impose all the equilibrium conditions as constraints in the optimization problem for finding the best allocations, as opposed to adjusting the prices later to make the allocations an equilibrium. While the optimization problem is, of course, non-convex, and non-convex problems are intractable in general, we present a tractable approximation algorithm for solving the proposed optimization problem. Our framework extends to the case of networked markets, which, to the best of our knowledge, has not been considered in previous work.
非凸成本市场的最优定价
我们考虑一个由经营者经营的市场,经营者寻求通过从一组具有非凸成本函数的竞争供应商那里购买所需数量的商品来满足给定的消费者对商品的需求。经营者知道供应商的成本函数,并宣布每个供应商的价格/支付函数,该函数决定了生产不同数量的供应商的支付。然后,每个供应商各自决定生产多少(以及是否参与),以使自己的利润最大化。关键问题是如何设计价格函数。这个问题与许多应用相关,包括电力市场。本文的主要贡献是引入了一个新的定价方案,\name (\acr)定价,它适用于一般的非凸成本,允许使用一般参数价格函数,并保证市场出清,收入充足性和经济效率,同时支持竞争均衡。该方案的名称源于这样一个事实,即我们直接将所有均衡条件作为优化问题的约束来寻找最佳分配,而不是稍后调整价格以使分配达到均衡。当然,优化问题是非凸的,而非凸问题通常是棘手的,我们提出了一个易于处理的近似算法来解决所提出的优化问题。我们的框架扩展到网络化市场的情况,据我们所知,在以前的工作中没有考虑到这一点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信