A Tight Lower Bound and Efficient Reduction for Swap Regret

Aug-22-2025, 00:53:59 GMT–Neural Information Processing Systems

Our lower bound is tight up to a constant, and resolves an open problem mentioned, e.g., in the book by Nisan

algorithm, assumption, swap regret, (17 more...)

Neural Information Processing Systems

Aug-22-2025, 00:53:59 GMT

Conferences PDF

Country:
- Asia > Japan (0.04)
- Europe > United Kingdom
  - England
    - Cambridgeshire > Cambridge (0.04)
    - Oxfordshire > Oxford (0.04)
- North America > Canada (0.04)

Technology:
- Information Technology
  - Artificial Intelligence > Machine Learning (1.00)
  - Data Science > Data Mining
    - Big Data (0.47)

Duplicate Docs Excel Report

Title
A Tight Lower Bound and Efficient Reduction for Swap Regret

Similar Docs Excel Report more

Title	Similarity	Source
None found