Online Learning for Equilibrium Pricing in Markets under Incomplete Information

The study of market equilibria is central to economic theory, particularly in efficiently allocating scarce resources. However, the computation of equilibrium prices at which the supply of goods matches their demand typically relies on having access to complete information on private attributes of a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Jalota, Devansh, Sun, Haoyuan, Azizan, Navid
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Jalota, Devansh
Sun, Haoyuan
Azizan, Navid
description The study of market equilibria is central to economic theory, particularly in efficiently allocating scarce resources. However, the computation of equilibrium prices at which the supply of goods matches their demand typically relies on having access to complete information on private attributes of agents, e.g., suppliers' cost functions, which are often unavailable in practice. Motivated by this practical consideration, we consider the problem of setting equilibrium prices in the incomplete information setting wherein a market operator seeks to satisfy the customer demand for a commodity by purchasing the required amount from competing suppliers with privately known cost functions unknown to the market operator. In this incomplete information setting, we consider the online learning problem of learning equilibrium prices over time while jointly optimizing three performance metrics -- unmet demand, cost regret, and payment regret -- pertinent in the context of equilibrium pricing over a horizon of $T$ periods. We first consider the setting when suppliers' cost functions are fixed and develop algorithms that achieve a regret of $O(\log \log T)$ when the customer demand is constant over time, or $O(\sqrt{T} \log \log T)$ when the demand is variable over time. Next, we consider the setting when the suppliers' cost functions can vary over time and illustrate that no online algorithm can achieve sublinear regret on all three metrics when the market operator has no information about how the cost functions change over time. Thus, we consider an augmented setting wherein the operator has access to hints/contexts that, without revealing the complete specification of the cost functions, reflect the variation in the cost functions over time and propose an algorithm with sublinear regret in this augmented setting.
doi_str_mv 10.48550/arxiv.2303.11522
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2303_11522</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2303_11522</sourcerecordid><originalsourceid>FETCH-LOGICAL-a672-36475256c5e4234278306a9b2238142c5290adec04a621271259eea1c66258b23</originalsourceid><addsrcrecordid>eNotj81OwzAQhH3hgAoPwAm_QIK9_klyRFWBSkHh0Hu0cbfVqolT3ATB29MWTjMa6RvpE-JBq9yWzqknTN_8lYNRJtfaAdyKpok9R5I1YYoc93I3Jrn6nLnnLvE8yI_E4bJzlO-YDjSd5By3lOQ6hnE49jTRuZ6pASce45242WF_ovv_XIjNy2qzfMvq5nW9fK4z9AVkxtvCgfPBkQVjoSiN8lh1AKbUFoKDSuGWgrLoQUOhwVVEqIP34MoOzEI8_t1ejdpj4gHTT3sxa69m5heMzUes</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Online Learning for Equilibrium Pricing in Markets under Incomplete Information</title><source>arXiv.org</source><creator>Jalota, Devansh ; Sun, Haoyuan ; Azizan, Navid</creator><creatorcontrib>Jalota, Devansh ; Sun, Haoyuan ; Azizan, Navid</creatorcontrib><description>The study of market equilibria is central to economic theory, particularly in efficiently allocating scarce resources. However, the computation of equilibrium prices at which the supply of goods matches their demand typically relies on having access to complete information on private attributes of agents, e.g., suppliers' cost functions, which are often unavailable in practice. Motivated by this practical consideration, we consider the problem of setting equilibrium prices in the incomplete information setting wherein a market operator seeks to satisfy the customer demand for a commodity by purchasing the required amount from competing suppliers with privately known cost functions unknown to the market operator. In this incomplete information setting, we consider the online learning problem of learning equilibrium prices over time while jointly optimizing three performance metrics -- unmet demand, cost regret, and payment regret -- pertinent in the context of equilibrium pricing over a horizon of $T$ periods. We first consider the setting when suppliers' cost functions are fixed and develop algorithms that achieve a regret of $O(\log \log T)$ when the customer demand is constant over time, or $O(\sqrt{T} \log \log T)$ when the demand is variable over time. Next, we consider the setting when the suppliers' cost functions can vary over time and illustrate that no online algorithm can achieve sublinear regret on all three metrics when the market operator has no information about how the cost functions change over time. Thus, we consider an augmented setting wherein the operator has access to hints/contexts that, without revealing the complete specification of the cost functions, reflect the variation in the cost functions over time and propose an algorithm with sublinear regret in this augmented setting.</description><identifier>DOI: 10.48550/arxiv.2303.11522</identifier><language>eng</language><subject>Computer Science - Computer Science and Game Theory ; Computer Science - Learning</subject><creationdate>2023-03</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2303.11522$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2303.11522$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Jalota, Devansh</creatorcontrib><creatorcontrib>Sun, Haoyuan</creatorcontrib><creatorcontrib>Azizan, Navid</creatorcontrib><title>Online Learning for Equilibrium Pricing in Markets under Incomplete Information</title><description>The study of market equilibria is central to economic theory, particularly in efficiently allocating scarce resources. However, the computation of equilibrium prices at which the supply of goods matches their demand typically relies on having access to complete information on private attributes of agents, e.g., suppliers' cost functions, which are often unavailable in practice. Motivated by this practical consideration, we consider the problem of setting equilibrium prices in the incomplete information setting wherein a market operator seeks to satisfy the customer demand for a commodity by purchasing the required amount from competing suppliers with privately known cost functions unknown to the market operator. In this incomplete information setting, we consider the online learning problem of learning equilibrium prices over time while jointly optimizing three performance metrics -- unmet demand, cost regret, and payment regret -- pertinent in the context of equilibrium pricing over a horizon of $T$ periods. We first consider the setting when suppliers' cost functions are fixed and develop algorithms that achieve a regret of $O(\log \log T)$ when the customer demand is constant over time, or $O(\sqrt{T} \log \log T)$ when the demand is variable over time. Next, we consider the setting when the suppliers' cost functions can vary over time and illustrate that no online algorithm can achieve sublinear regret on all three metrics when the market operator has no information about how the cost functions change over time. Thus, we consider an augmented setting wherein the operator has access to hints/contexts that, without revealing the complete specification of the cost functions, reflect the variation in the cost functions over time and propose an algorithm with sublinear regret in this augmented setting.</description><subject>Computer Science - Computer Science and Game Theory</subject><subject>Computer Science - Learning</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj81OwzAQhH3hgAoPwAm_QIK9_klyRFWBSkHh0Hu0cbfVqolT3ATB29MWTjMa6RvpE-JBq9yWzqknTN_8lYNRJtfaAdyKpok9R5I1YYoc93I3Jrn6nLnnLvE8yI_E4bJzlO-YDjSd5By3lOQ6hnE49jTRuZ6pASce45242WF_ovv_XIjNy2qzfMvq5nW9fK4z9AVkxtvCgfPBkQVjoSiN8lh1AKbUFoKDSuGWgrLoQUOhwVVEqIP34MoOzEI8_t1ejdpj4gHTT3sxa69m5heMzUes</recordid><startdate>20230320</startdate><enddate>20230320</enddate><creator>Jalota, Devansh</creator><creator>Sun, Haoyuan</creator><creator>Azizan, Navid</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20230320</creationdate><title>Online Learning for Equilibrium Pricing in Markets under Incomplete Information</title><author>Jalota, Devansh ; Sun, Haoyuan ; Azizan, Navid</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a672-36475256c5e4234278306a9b2238142c5290adec04a621271259eea1c66258b23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computer Science - Computer Science and Game Theory</topic><topic>Computer Science - Learning</topic><toplevel>online_resources</toplevel><creatorcontrib>Jalota, Devansh</creatorcontrib><creatorcontrib>Sun, Haoyuan</creatorcontrib><creatorcontrib>Azizan, Navid</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Jalota, Devansh</au><au>Sun, Haoyuan</au><au>Azizan, Navid</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Online Learning for Equilibrium Pricing in Markets under Incomplete Information</atitle><date>2023-03-20</date><risdate>2023</risdate><abstract>The study of market equilibria is central to economic theory, particularly in efficiently allocating scarce resources. However, the computation of equilibrium prices at which the supply of goods matches their demand typically relies on having access to complete information on private attributes of agents, e.g., suppliers' cost functions, which are often unavailable in practice. Motivated by this practical consideration, we consider the problem of setting equilibrium prices in the incomplete information setting wherein a market operator seeks to satisfy the customer demand for a commodity by purchasing the required amount from competing suppliers with privately known cost functions unknown to the market operator. In this incomplete information setting, we consider the online learning problem of learning equilibrium prices over time while jointly optimizing three performance metrics -- unmet demand, cost regret, and payment regret -- pertinent in the context of equilibrium pricing over a horizon of $T$ periods. We first consider the setting when suppliers' cost functions are fixed and develop algorithms that achieve a regret of $O(\log \log T)$ when the customer demand is constant over time, or $O(\sqrt{T} \log \log T)$ when the demand is variable over time. Next, we consider the setting when the suppliers' cost functions can vary over time and illustrate that no online algorithm can achieve sublinear regret on all three metrics when the market operator has no information about how the cost functions change over time. Thus, we consider an augmented setting wherein the operator has access to hints/contexts that, without revealing the complete specification of the cost functions, reflect the variation in the cost functions over time and propose an algorithm with sublinear regret in this augmented setting.</abstract><doi>10.48550/arxiv.2303.11522</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2303.11522
ispartof
issn
language eng
recordid cdi_arxiv_primary_2303_11522
source arXiv.org
subjects Computer Science - Computer Science and Game Theory
Computer Science - Learning
title Online Learning for Equilibrium Pricing in Markets under Incomplete Information
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T16%3A26%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Online%20Learning%20for%20Equilibrium%20Pricing%20in%20Markets%20under%20Incomplete%20Information&rft.au=Jalota,%20Devansh&rft.date=2023-03-20&rft_id=info:doi/10.48550/arxiv.2303.11522&rft_dat=%3Carxiv_GOX%3E2303_11522%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true