Saved in:
| Main Authors: | Collina, Natalie, Derr, Rabanus, Roth, Aaron |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2409.05608 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Personalization Aids Pluralistic Alignment Under Competition
by: Collina, Natalie, et al.
Published: (2026)
by: Collina, Natalie, et al.
Published: (2026)
Repeated Contracting with Multiple Non-Myopic Agents: Policy Regret and Limited Liability
by: Collina, Natalie, et al.
Published: (2024)
by: Collina, Natalie, et al.
Published: (2024)
Pareto-Optimal Algorithms for Learning in Games
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)
Efficient Stackelberg Strategies for Finitely Repeated Games
by: Collina, Natalie, et al.
Published: (2022)
by: Collina, Natalie, et al.
Published: (2022)
Tractable Agreement Protocols
by: Collina, Natalie, et al.
Published: (2024)
by: Collina, Natalie, et al.
Published: (2024)
Emergent Alignment via Competition
by: Collina, Natalie, et al.
Published: (2025)
by: Collina, Natalie, et al.
Published: (2025)
Bandit Social Learning with Exploration Episodes
by: Banihashem, Kiarash, et al.
Published: (2026)
by: Banihashem, Kiarash, et al.
Published: (2026)
Algorithmic Collusion Without Threats
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)
Swap Regret and Correlated Equilibria Beyond Normal-Form Games
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2025)
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2025)
Collaborative Prediction: Tractable Information Aggregation via Agreement
by: Collina, Natalie, et al.
Published: (2025)
by: Collina, Natalie, et al.
Published: (2025)
Learning to Play Against Unknown Opponents
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)
Breaking Algorithmic Collusion in Human-AI Ecosystems
by: Collina, Natalie, et al.
Published: (2025)
by: Collina, Natalie, et al.
Published: (2025)
Which Games are Unaffected by Absolute Commitments?
by: Landis, Daji, et al.
Published: (2023)
by: Landis, Daji, et al.
Published: (2023)
Ambiguous Contracts
by: Dütting, Paul, et al.
Published: (2023)
by: Dütting, Paul, et al.
Published: (2023)
Commitment to Sparse Strategies in Two-Player Games
by: Afiouni, Salam, et al.
Published: (2024)
by: Afiouni, Salam, et al.
Published: (2024)
The ICML 2023 Ranking Experiment: Examining Author Self-Assessment in ML/AI Peer Review
by: Su, Buxin, et al.
Published: (2024)
by: Su, Buxin, et al.
Published: (2024)
Succinct Ambiguous Contracts
by: Duetting, Paul, et al.
Published: (2025)
by: Duetting, Paul, et al.
Published: (2025)
Online Scalarization in Vector-Valued Games
by: Asadollahi, Ehsan, et al.
Published: (2026)
by: Asadollahi, Ehsan, et al.
Published: (2026)
Near-Optimal Dropout-Robust Sortition
by: Gambhir, Maya Pal, et al.
Published: (2025)
by: Gambhir, Maya Pal, et al.
Published: (2025)
Recommending Best Paper Awards for ML/AI Conferences via the Isotonic Mechanism
by: Wen, Garrett G., et al.
Published: (2026)
by: Wen, Garrett G., et al.
Published: (2026)
Value-Set Iteration: Computing Optimal Correlated Equilibria in Infinite-Horizon Multi-Player Stochastic Games
by: Gan, Jiarui, et al.
Published: (2025)
by: Gan, Jiarui, et al.
Published: (2025)
The Value of Compromising Strategic Intent in General Lotto Games
by: Diaz-Garcia, Gilberto, et al.
Published: (2024)
by: Diaz-Garcia, Gilberto, et al.
Published: (2024)
Forecasting for Swap Regret for All Downstream Agents
by: Roth, Aaron, et al.
Published: (2024)
by: Roth, Aaron, et al.
Published: (2024)
Universal Complexity Bounds Based on Value Iteration for Stochastic Mean Payoff Games and Entropy Games
by: Allamigeon, Xavier, et al.
Published: (2022)
by: Allamigeon, Xavier, et al.
Published: (2022)
Prediction Accuracy of Learning in Games : Follow-the-Regularized-Leader meets Heisenberg
by: Feng, Yi, et al.
Published: (2024)
by: Feng, Yi, et al.
Published: (2024)
(Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential Games
by: Anagnostides, Ioannis, et al.
Published: (2026)
by: Anagnostides, Ioannis, et al.
Published: (2026)
A New Value for Cooperative Games on Intersection-Closed Systems
by: Černý, Martin
Published: (2025)
by: Černý, Martin
Published: (2025)
Pool Formation in Oceanic Games: Shapley Value and Proportional Sharing
by: Kiayias, Aggelos, et al.
Published: (2025)
by: Kiayias, Aggelos, et al.
Published: (2025)
The Value Problem for Weighted Timed Games with Two Clocks is Undecidable
by: Guilmant, Quentin, et al.
Published: (2025)
by: Guilmant, Quentin, et al.
Published: (2025)
Beyond Arbitrary Allocations: Security Values in Constrained General Lotto Games
by: Paarporn, Keith, et al.
Published: (2026)
by: Paarporn, Keith, et al.
Published: (2026)
Why Open Source? A Game-Theoretic Analysis of the AI Race
by: Mladenovic, Andjela, et al.
Published: (2026)
by: Mladenovic, Andjela, et al.
Published: (2026)
Incentive Designs for Stackelberg Games with a Large Number of Followers and their Mean-Field Limits
by: Sanjari, Sina, et al.
Published: (2022)
by: Sanjari, Sina, et al.
Published: (2022)
Multi-group Bayesian Games
by: Yuan, Hongxing, et al.
Published: (2025)
by: Yuan, Hongxing, et al.
Published: (2025)
Strategic Interactions in Multi-Level Stackelberg Games with Non-Follower Agents and Heterogeneous Leaders
by: Aminikalibar, Niloofar, et al.
Published: (2026)
by: Aminikalibar, Niloofar, et al.
Published: (2026)
Optimal MEV Extraction Using Absolute Commitments
by: Landis, Daji, et al.
Published: (2024)
by: Landis, Daji, et al.
Published: (2024)
Emergence of Cooperation and Commitment in Optional Prisoner's Dilemma
by: Song, Zhao, et al.
Published: (2025)
by: Song, Zhao, et al.
Published: (2025)
Learning to Play Multi-Follower Bayesian Stackelberg Games
by: Personnat, Gerson, et al.
Published: (2025)
by: Personnat, Gerson, et al.
Published: (2025)
Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints
by: Bechavod, Yahav, et al.
Published: (2025)
by: Bechavod, Yahav, et al.
Published: (2025)
The Relationship between No-Regret Learning and Online Conformal Prediction
by: Ramalingam, Ramya, et al.
Published: (2025)
by: Ramalingam, Ramya, et al.
Published: (2025)
Sample Efficient Omniprediction and Downstream Swap Regret for Non-Linear Losses
by: Lu, Jiuyao, et al.
Published: (2025)
by: Lu, Jiuyao, et al.
Published: (2025)
Similar Items
-
Personalization Aids Pluralistic Alignment Under Competition
by: Collina, Natalie, et al.
Published: (2026) -
Repeated Contracting with Multiple Non-Myopic Agents: Policy Regret and Limited Liability
by: Collina, Natalie, et al.
Published: (2024) -
Pareto-Optimal Algorithms for Learning in Games
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024) -
Efficient Stackelberg Strategies for Finitely Repeated Games
by: Collina, Natalie, et al.
Published: (2022) -
Tractable Agreement Protocols
by: Collina, Natalie, et al.
Published: (2024)