Cover Image

Tractable Agreement Protocols

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Collina, Natalie, Goel, Surbhi, Gupta, Varun, Roth, Aaron
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Data Structures and Algorithms Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Tractable Graph Structures in EFX Orientation
by: Blažej, Václav, et al.
Published: (2025)

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

Emergent Alignment via Competition
by: Collina, Natalie, et al.
Published: (2025)

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

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

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

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

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

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

High dimensional online calibration in polynomial time
by: Peng, Binghui
Published: (2025)

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

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

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

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

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

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

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

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

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

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

Contextual Learning for Stochastic Optimization
by: Heuser, Anna, et al.
Published: (2025)

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

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

Water-Filling is Universally Minimax Optimal
by: Banerjee, Siddhartha, et al.
Published: (2026)

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

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

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

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

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

Personalization Aids Pluralistic Alignment Under Competition
by: Collina, Natalie, et al.
Published: (2026)

An Exercise in Tournament Design: When Some Matches Must Be Scheduled
by: Gupta, Sushmita, et al.
Published: (2024)

Budget-feasible Egalitarian Allocation of Conflicting Jobs
by: Gupta, Sushmita, et al.
Published: (2024)

On Controlling Knockout Tournaments Without Perfect Information
by: Blažej, Václav, et al.
Published: (2024)

When agents choose bundles autonomously: guarantees beyond discrepancy
by: Gupta, Sushmita, et al.
Published: (2026)

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

More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules
by: Gupta, Sushmita, et al.
Published: (2025)

Robust Value Maximization in Challenge the Champ Tournaments with Probabilistic Outcomes
by: Bhaskar, Umang, et al.
Published: (2026)

When far is better: The Chamberlin-Courant approach to obnoxious committee selection
by: Gupta, Sushmita, et al.
Published: (2024)