Cover Image

Fairness-aware Contextual Dynamic Pricing with Strategic Buyers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Pangpang, Sun, Will Wei
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Contextual Dynamic Pricing with Strategic Buyers
by: Liu, Pangpang, et al.
Published: (2023)

Dynamic Pricing of an Expiring Item under Strategic Buyers with Stochastic Arrival
by: Choi, Suyeon, et al.
Published: (2025)

Strategic Linear Contextual Bandits
by: Buening, Thomas Kleine, et al.
Published: (2024)

Learning Optimal Posted Prices for a Unit-Demand Buyer
by: Teng, Yifeng, et al.
Published: (2025)

Improved Algorithms for Contextual Dynamic Pricing
by: Tullii, Matilde, et al.
Published: (2024)

Dynamic Pricing and Advertising with Demand Learning
by: Agrawal, Shipra, et al.
Published: (2023)

Strategically-Robust Learning Algorithms for Bidding in First-Price Auctions
by: Kumar, Rachitesh, et al.
Published: (2024)

Learning Safe Strategies for Value Maximizing Buyers in Uniform Price Auctions
by: Golrezaei, Negin, et al.
Published: (2024)

Dynamic Pricing and Learning with Long-term Reference Effects
by: Agrawal, Shipra, et al.
Published: (2024)

Collaborative Mean Estimation Among Heterogeneous Strategic Agents: Individual Rationality, Fairness, and Truthful Contribution
by: Clinton, Alex, et al.
Published: (2024)

Optimal Pricing Schemes for Identical Items with Time-Sensitive Buyers
by: Liu, Zhengyang, et al.
Published: (2023)

Dynamic Reserve Price Design with Distributed Solving Algorithm
by: Li, Mang
Published: (2022)

Online Assortment and Price Optimization Under Contextual Choice Models
by: Erginbas, Yigit Efe, et al.
Published: (2025)

Pricing Query Complexity of Multiplicative Revenue Approximation
by: Tang, Wei, et al.
Published: (2026)

No Coin Left Behind: Maximizing Strategic Surplus Against No-Regret Dynamics
by: Su, Yiheng, et al.
Published: (2026)

Is Online Linear Optimization Sufficient for Strategic Robustness?
by: Cai, Yang, et al.
Published: (2026)

Online Learning for Equilibrium Pricing in Markets under Incomplete Information
by: Jalota, Devansh, et al.
Published: (2023)

Market Games for Generative Models: Equilibria, Welfare, and Strategic Entry
by: Wei, Xiukun, et al.
Published: (2026)

Learning In Reverse Causal Strategic Environments With Ramifications on Two Sided Markets
by: Somerstep, Seamus, et al.
Published: (2024)

Strategic Littlestone Dimension: Improved Bounds on Online Strategic Classification
by: Ahmadi, Saba, et al.
Published: (2024)

To Give or Not to Give? The Impacts of Strategically Withheld Recourse
by: Chen, Yatong, et al.
Published: (2025)

Maximin Relative Improvement: Fair Learning as a Bargaining Problem
by: Han, Jiwoo, et al.
Published: (2026)

Revenue-Optimal Pricing for Budget-Constrained Buyers in Data Markets
by: Chaudhury, Bhaskar Ray, et al.
Published: (2026)

Bayesian Strategic Classification
by: Cohen, Lee, et al.
Published: (2024)

Strategizing against No-Regret Learners in First-Price Auctions
by: Rubinstein, Aviad, et al.
Published: (2024)

Strategic Costs of Perceived Bias in Fair Selection
by: Celis, L. Elisa, et al.
Published: (2025)

Contextual Online Bilateral Trade
by: Cosson, Romain, et al.
Published: (2026)

Data Pricing for Graph Neural Networks without Pre-purchased Inspection
by: Liu, Yiping, et al.
Published: (2025)

Pareto-Efficient Multi-Buyer Mechanisms: Characterization, Fairness and Welfare
by: Babaioff, Moshe, et al.
Published: (2026)

Strategizing against No-regret Learners
by: Deng, Yuan, et al.
Published: (2019)

Learnability Gaps of Strategic Classification
by: Cohen, Lee, et al.
Published: (2024)

Nonparametric Contextual Online Bilateral Trade
by: Coccia, Emanuele, et al.
Published: (2026)

Pricing and Competition for Generative AI
by: Mahmood, Rafid
Published: (2024)

Learning to Price Homogeneous Data
by: Chen, Keran, et al.
Published: (2024)

Fairness under Competition
by: Gradwohl, Ronen, et al.
Published: (2025)

The Active and Noise-Tolerant Strategic Perceptron
by: Balcan, Maria-Florina, et al.
Published: (2025)

Fundamental Bounds on Online Strategic Classification
by: Ahmadi, Saba, et al.
Published: (2023)

On Randomized Algorithms in Online Strategic Classification
by: Hutton, Chase, et al.
Published: (2026)

Adaptive Bandit Algorithms for Contextual Matching Markets
by: Lin, Shiyun, et al.
Published: (2026)

DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information
by: Xin, Yun, et al.
Published: (2025)