{"total":48,"rows":[{"id":"2102.11494","title":"Sample-Efficient Learning of Stackelberg Equilibria in General-Sum Games","created":"2021-02-23","cited_by_count":40,"area":null},{"id":"2202.13110","title":"Optimal-er Auctions through Attention","created":"2022-02-26","cited_by_count":27,"area":null},{"id":"2305.12162","title":"A Scalable Neural Network for DSIC Affine Maximizer Auction Design","created":"2023-05-20","cited_by_count":24,"area":null},{"id":"2205.08715","title":"Customizing ML Predictions for Online Algorithms","created":"2022-05-18","cited_by_count":21,"area":null},{"id":"2102.08754","title":"A Regret Analysis of Bilateral Trade","created":"2021-02-16","cited_by_count":19,"area":null},{"id":"2201.12489","title":"A Context-Integrated Transformer-Based Neural Network for Auction Design","created":"2022-01-29","cited_by_count":19,"area":null},{"id":"2504.11320","title":"Optimizing LLM Inference: Fluid-Guided Online Scheduling with Memory Constraints","created":"2025-04-15","cited_by_count":19,"area":null},{"id":"2106.07877","title":"Learning Revenue-Maximizing Auctions With Differentiable Matching","created":"2021-06-15","cited_by_count":14,"area":null},{"id":"2210.05579","title":"Benefits of Permutation-Equivariance in Auction Mechanisms","created":"2022-10-11","cited_by_count":8,"area":null},{"id":"2312.15427","title":"Semi-Bandit Learning for Monotone Stochastic Optimization","created":"2023-12-24","cited_by_count":8,"area":null},{"id":"2107.01835","title":"Fast Rate Learning in Stochastic First Price Bidding","created":"2021-07-05","cited_by_count":7,"area":null},{"id":"2509.22563","title":"Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade","created":"2025-09-26","cited_by_count":7,"area":null},{"id":"2312.12794","title":"Bandit Sequential Posted Pricing via Half-Concavity","created":"2023-12-20","cited_by_count":5,"area":null},{"id":"2401.11596","title":"Learning to Maximize Gains From Trade in Small Markets","created":"2024-01-21","cited_by_count":5,"area":null},{"id":"2409.07819","title":"Selling Joint Ads: A Regret Minimization Perspective","created":"2024-09-12","cited_by_count":5,"area":null},{"id":"2302.11700","title":"New Guarantees for Learning Revenue Maximizing Menus of Lotteries and Two-Part Tariffs","created":"2023-02-22","cited_by_count":4,"area":null},{"id":"2308.10226","title":"Machine Learning-Powered Combinatorial Clock Auction","created":"2023-08-20","cited_by_count":4,"area":null},{"id":"2107.06259","title":"Robust Learning of Optimal Auctions","created":"2021-07-13","cited_by_count":3,"area":null},{"id":"2312.04653","title":"Learning Thresholds with Latent Values and Censored Feedback","created":"2023-12-07","cited_by_count":3,"area":null},{"id":"2411.00707","title":"Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithms","created":"2024-11-01","cited_by_count":3,"area":null},{"id":"2501.14474","title":"The Pseudo-Dimension of Contracts","created":"2025-01-24","cited_by_count":3,"area":null},{"id":"2104.05182","title":"Automated Mechanism Design for Classification with Partial Verification","created":"2021-04-12","cited_by_count":2,"area":null},{"id":"2411.09355","title":"Prices, Bids, Values: One ML-Powered Combinatorial Auction to Rule Them All","created":"2024-11-14","cited_by_count":2,"area":null},{"id":"2510.01387","title":"Learning to Play Multi-Follower Bayesian Stackelberg Games","created":"2025-10-01","cited_by_count":2,"area":null},{"id":"2202.10944","title":"Convex Surrogate Loss Functions for Contextual Pricing with Transaction Data","created":"2022-02-16","cited_by_count":1,"area":null},{"id":"2211.15792","title":"Provably Efficient Model-free RL in Leader-Follower MDP with Linear Function Approximation","created":"2022-11-28","cited_by_count":1,"area":null},{"id":"2212.06422","title":"How Does Independence Help Generalization? Sample Complexity of ERM on Product Distributions","created":"2022-12-13","cited_by_count":1,"area":null},{"id":"2302.08108","title":"User Response in Ad Auctions: An MDP Formulation of Long-Term Revenue Optimization","created":"2023-02-16","cited_by_count":1,"area":null},{"id":"2405.07038","title":"Online Auction Design Using Distribution-Free Uncertainty Quantification with Applications to E-Commerce","created":"2024-05-11","cited_by_count":1,"area":null},{"id":"2503.10773","title":"Learn then Decide: A Learning Approach for Designing Data Marketplaces","created":"2025-03-13","cited_by_count":1,"area":null},{"id":"2503.16737","title":"Revenue Maximization Under Sequential Price Competition Via The Estimation Of s-Concave Demand Functions","created":"2025-03-20","cited_by_count":1,"area":null},{"id":"2506.02284","title":"Learning Optimal Posted Prices for a Unit-Demand Buyer","created":"2025-06-02","cited_by_count":1,"area":null},{"id":"2605.21736","title":"Support-aware offline policy selection for advertising marketplaces","created":"2026-05-20","cited_by_count":1,"area":null},{"id":"2204.12723","title":"On the limitations of data-based price discrimination","created":"2022-04-27","cited_by_count":0,"area":null},{"id":"2207.10140","title":"Learning Underspecified Models","created":"2022-07-20","cited_by_count":0,"area":null},{"id":"2207.13126","title":"Sample Complexity of Forecast Aggregation","created":"2022-07-26","cited_by_count":0,"area":null},{"id":"2208.06536","title":"Double Auctions with Two-sided Bandit Feedback","created":"2022-08-13","cited_by_count":0,"area":null},{"id":"2305.11362","title":"Differentially Private Online Item Pricing","created":"2023-05-19","cited_by_count":0,"area":null},{"id":"2310.07874","title":"Refined Mechanism Design for Approximately Structured Priors via Active Regression","created":"2023-10-11","cited_by_count":0,"area":null},{"id":"2405.03158","title":"Decentralized Online Learning in General-Sum Stackelberg Games","created":"2024-05-06","cited_by_count":0,"area":null},{"id":"2407.04898","title":"Nash Incentive-compatible Online Mechanism Learning via Weakly Differentially Private Online Learning","created":"2024-07-06","cited_by_count":0,"area":null},{"id":"2505.16829","title":"Contextual Learning for Stochastic Optimization","created":"2025-05-22","cited_by_count":0,"area":null},{"id":"2507.02801","title":"Learning to Coordinate Bidders in Non-Truthful Auctions","created":"2025-07-03","cited_by_count":0,"area":null},{"id":"2601.01496","title":"The Optimal Sample Complexity of Linear Contracts","created":"2026-01-04","cited_by_count":0,"area":null},{"id":"2602.10483","title":"Pricing Query Complexity of Multiplicative Revenue Approximation","created":"2026-02-11","cited_by_count":0,"area":null},{"id":"2604.26922","title":"On the Learning Curves of Revenue Maximization","created":"2026-04-29","cited_by_count":0,"area":null},{"id":"2608.06135","title":"LLM Inference Under Bursty Workload Distribution: Modifying the WAIT Algorithm","created":"2026-08-06","cited_by_count":0,"area":null},{"id":"2608.16699","title":"Learning to Price with Persuasion","created":"2026-08-17","cited_by_count":0,"area":null}],"next_cursor":null}