Imagen de Portada

Water-Filling is Universally Minimax Optimal

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Banerjee, Siddhartha, Vuong, Ramiro N. Deo-Campo, Kleinberg, Robert
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Computer Science and Game Theory Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Procurement Auctions via Approximately Optimal Submodular Optimization
por: Deng, Yuan, et al.
Publicado: (2024)

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

Online Matroid Embeddings
por: Cristi, Andrés, et al.
Publicado: (2024)

A Minimax Perspective on Almost-Stable Matchings
por: Glitzner, Frederik, et al.
Publicado: (2026)

Computing Optimal Regularizers for Online Linear Optimization
por: Gatmiry, Khashayar, et al.
Publicado: (2024)

On the Learning Curves of Revenue Maximization
por: Hanneke, Steve, et al.
Publicado: (2026)

High dimensional online calibration in polynomial time
por: Peng, Binghui
Publicado: (2025)

Repeated Bilateral Trade Against a Smoothed Adversary
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2023)

Improved Regret and Contextual Linear Extension for Pandora's Box and Prophet Inequality
por: Liu, Junyan, et al.
Publicado: (2025)

Repeated Contracting with Multiple Non-Myopic Agents: Policy Regret and Limited Liability
por: Collina, Natalie, et al.
Publicado: (2024)

Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
por: Vaze, Rahul, et al.
Publicado: (2025)

High-Dimensional Calibration from Swap Regret
por: Fishelson, Maxwell, et al.
Publicado: (2025)

An $α$-regret analysis of Adversarial Bilateral Trade
por: Azar, Yossi, et al.
Publicado: (2022)

Fixed Point Computation: Beating Brute Force with Smoothed Analysis
por: Attias, Idan, et al.
Publicado: (2025)

Bandit Sequential Posted Pricing via Half-Concavity
por: Singla, Sahil, et al.
Publicado: (2023)

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

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2023)

Simultaneous Swap Regret Minimization via KL-Calibration
por: Luo, Haipeng, et al.
Publicado: (2025)

Collaborative Prediction: Tractable Information Aggregation via Agreement
por: Collina, Natalie, et al.
Publicado: (2025)

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

Contextual Learning for Stochastic Optimization
por: Heuser, Anna, et al.
Publicado: (2025)

Bandit Social Learning: Exploration under Myopic Behavior
por: Banihashem, Kiarash, et al.
Publicado: (2023)

Smooth Nash Equilibria: Algorithms and Complexity
por: Daskalakis, Constantinos, et al.
Publicado: (2023)

Incentivizing Exploration with Selective Data Disclosure
por: Immorlica, Nicole, et al.
Publicado: (2018)

Adaptive Discretization against an Adversary: Lipschitz bandits, Dynamic Pricing, and Auction Tuning
por: Podimata, Chara, et al.
Publicado: (2020)

Learning in Stackelberg Games with Non-myopic Agents
por: Haghtalab, Nika, et al.
Publicado: (2022)

Single-Sample and Robust Online Resource Allocation
por: Ghuge, Rohan, et al.
Publicado: (2025)

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

Roping in Uncertainty: Robustness and Regularization in Markov Games
por: McMahan, Jeremy, et al.
Publicado: (2024)

Tractable Agreement Protocols
por: Collina, Natalie, et al.
Publicado: (2024)

Online Combinatorial Allocations and Auctions with Few Samples
por: Dütting, Paul, et al.
Publicado: (2024)

Equilibria, Efficiency, and Inequality in Network Formation for Hiring and Opportunity
por: Dwork, Cynthia, et al.
Publicado: (2024)

Optimal Pricing with Unreliable Signals
por: Tang, Zhihao Gavin, et al.
Publicado: (2026)

Optimal Stopping with Interdependent Values
por: Mauras, Simon, et al.
Publicado: (2024)

Condorcet Dimension and Pareto Optimality for Matchings and Beyond
por: Kavitha, Telikepalli, et al.
Publicado: (2026)

Near-Feasible Stable Matchings: Incentives and Optimality
por: Glitzner, Frederik
Publicado: (2026)

Optimal Capacity Modification for Stable Matchings with Ties
por: Ranjan, Keshav, et al.
Publicado: (2024)

Trading Prophets: How to Trade Multiple Stocks Optimally
por: Rajput, Surbhi, et al.
Publicado: (2025)

Optimal Single-Choice Prophet Inequalities from Samples
por: Rubinstein, Aviad, et al.
Publicado: (2019)

Optimally Interpolating between Ex-Ante Fairness and Welfare
por: Høgsgaard, Mikael Møller, et al.
Publicado: (2023)