Inferring Heterogeneous Private Valuations from Offline Market Data via Entropic Risk-Sensitive Utility Maximization
Xingyu Qian, Haoran Yu
Abstract
Inferring humans' private valuations for goods from their observed market behavior is essential for evaluating market efficiency and improving trading mechanism design. A core challenge lies in uncovering the human decision function that maps private valuations and observed market states to actions. In complex market settings where humans make sequential decisions in stochastic environments, neural networks offer the flexibility to model this decision function. However, training them without access to private valuations or environment dynamics remains challenging. We tackle this challenge and study how to infer heterogeneous human valuations from offline decision data in continuous double auctions. We propose learning the decision function via risk‑sensitive utility maximization. First, we train a generative model on offline bid and ask data to simulate individual trading behavior. Using this generative model, we instantiate simulated markets composed of randomly generated buyers and sellers. Second, we introduce an agent into these simulated markets and use reinforcement learning to learn a risk-sensitive utility-maximizing decision function for the agent. Third, we formulate a bilevel optimization to jointly recover private valuations and risk preference parameters. Our extensive experiments on a large‑scale continuous double auction dataset demonstrate that our framework significantly reduces errors in inferring real human valuations.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 52408b99-47e7-44a2-b0fc-c4c4063fdd6fBuilds on8
- RvS: What is Essential for Offline RL via Supervised Learning?Scott Emmons, Benjamin Eysenbach, Ilya Kostrikov, Sergey LevineICLR 2022 · 225 citations
- Risk-Sensitive Reinforcement Learning: Near-Optimal Risk-Sample Tradeoff in RegretYingjie Fei, Zhuoran Yang, Yudong Chen, Zhaoran Wang et al.NeurIPS 2020 · 87 citations
- Maximum-Likelihood Inverse Reinforcement Learning with Finite-Time GuaranteesSiliang Zeng, Chenliang Li, Alfredo García, Mingyi HongNeurIPS 2022 · 60 citations
- Inverse Game Theory for Stackelberg Games: the Blessing of Bounded RationalityJibang Wu, Weiran Shen, Fei Fang, Haifeng XuNeurIPS 2022 · 27 citations
- Bid Prediction in Repeated Auctions with LearningGali Noti, Vasilis SyrgkanisWWW 2021 · 24 citations
Related papers
- Data-Driven Knowledge-Aware Inference of Private Information in Continuous Double AuctionsLvye Cui, Haoran YuAAAI 2024
- Learning Utilities from Demonstrations in Markov Decision ProcessesFilippo Lazzati, Alberto Maria MetelliICML 2025
- Learning Optimal Auctions with Correlated Value DistributionsDa Huo, Zhenzhe Zheng, Fan WuAAAI 2025 · 4 citations
- Benefits of Permutation-Equivariance in Auction MechanismsTian Qin, Fengxiang He, Dingfeng Shi, Wenbing Huang et al.NeurIPS 2022 · 13 citations
- Double Auctions with Two-sided Bandit FeedbackSoumya Basu, Abishek SankararamanNeurIPS 2023 · 3 citations
