Bi-Criteria Metric Distortion
Fuente:
arXiv
Saved in:
| Main Authors: | Banihashem, Kiarash, Chakraborty, Diptarka, Jahan, Shayan Chashm, Gholami, Iman, Hajiaghayi, MohammadTaghi, Mahdavi, Mohammad, Springer, Max |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Fairness and Efficiency in Online Class Matching
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2024)
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2024)
Bandit Social Learning: Exploration under Myopic Behavior
by: Banihashem, Kiarash, et al.
Published: (2023)
by: Banihashem, Kiarash, et al.
Published: (2023)
Dynamic Metric Embedding into $\ell_p$ Space
by: Banihashem, Kiarash, et al.
Published: (2024)
by: Banihashem, Kiarash, et al.
Published: (2024)
Replication-proof Bandit Mechanism Design with Bayesian Agents
by: Shin, Suho, et al.
Published: (2023)
by: Shin, Suho, et al.
Published: (2023)
2-Approximation for Prize-Collecting Steiner Forest
by: Ahmadi, Ali, et al.
Published: (2023)
by: Ahmadi, Ali, et al.
Published: (2023)
Breaking a Long-Standing Barrier: 2-$\varepsilon$ Approximation for Steiner Forest
by: Ahmadi, Ali, et al.
Published: (2025)
by: Ahmadi, Ali, et al.
Published: (2025)
Prize-Collecting Forest with Submodular Penalties: Improved Approximation
by: Ahmadi, Ali, et al.
Published: (2025)
by: Ahmadi, Ali, et al.
Published: (2025)
Prize-Collecting Steiner Tree: A 1.79 Approximation
by: Ahmadi, Ali, et al.
Published: (2024)
by: Ahmadi, Ali, et al.
Published: (2024)
Optimal Contest Beyond Convexity
by: Golrezaei, Negin, et al.
Published: (2026)
by: Golrezaei, Negin, et al.
Published: (2026)
Matroid Algorithms Under Size-Sensitive Independence Oracles
by: Banihashem, Kiarash, et al.
Published: (2026)
by: Banihashem, Kiarash, et al.
Published: (2026)
Replicable Composition
by: Banihashem, Kiarash, et al.
Published: (2026)
by: Banihashem, Kiarash, et al.
Published: (2026)
A Dynamic Algorithm for Weighted Submodular Cover Problem
by: Banihashem, Kiarash, et al.
Published: (2024)
by: Banihashem, Kiarash, et al.
Published: (2024)
Dynamic Diameter in High-Dimensions against Adaptive Adversary and Beyond
by: Banihashem, Kiarash, et al.
Published: (2025)
by: Banihashem, Kiarash, et al.
Published: (2025)
Beating Competitive Ratio 4 for Graphic Matroid Secretary
by: Banihashem, Kiarash, et al.
Published: (2025)
by: Banihashem, Kiarash, et al.
Published: (2025)
Delegation with Costly Inspection
by: Hajiaghayi, Mohammad T., et al.
Published: (2025)
by: Hajiaghayi, Mohammad T., et al.
Published: (2025)
Pandora with Inaccurate Priors
by: Banihashem, Kiarash, et al.
Published: (2025)
by: Banihashem, Kiarash, et al.
Published: (2025)
Active Learning for Decision Trees with Provable Guarantees
by: Moakhar, Arshia Soltani, et al.
Published: (2026)
by: Moakhar, Arshia Soltani, et al.
Published: (2026)
Algorithmic Delegated Choice: An Annotated Reading List
by: Hajiaghayi, Mohammad T., et al.
Published: (2025)
by: Hajiaghayi, Mohammad T., et al.
Published: (2025)
Adversarially Robust Approximate Furthest Neighbor
by: Banihashem, Kiarash, et al.
Published: (2026)
by: Banihashem, Kiarash, et al.
Published: (2026)
Beyond the Half-Approximation: Fair and Efficient Online Class Matching
by: Borst, Sander, et al.
Published: (2026)
by: Borst, Sander, et al.
Published: (2026)
How Bad Is Forming Your Own Multidimensional Opinion?
by: Banihashem, Kiarash, et al.
Published: (2025)
by: Banihashem, Kiarash, et al.
Published: (2025)
Metric Distortion of Line-up Elections: The Right Person for the Right Job
by: Jerrett, Christopher, et al.
Published: (2024)
by: Jerrett, Christopher, et al.
Published: (2024)
Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance
by: Das, Debarati, et al.
Published: (2025)
by: Das, Debarati, et al.
Published: (2025)
Distortion of Metric Voting with Bounded Randomness
by: Cai, Ziyi, et al.
Published: (2026)
by: Cai, Ziyi, et al.
Published: (2026)
The Distortion of Prior-Independent b-Matching Mechanisms
by: Caragiannis, Ioannis, et al.
Published: (2026)
by: Caragiannis, Ioannis, et al.
Published: (2026)
A Strongly Polynomial Algorithm for Arctic Auctions
by: Garg, Jugal, et al.
Published: (2026)
by: Garg, Jugal, et al.
Published: (2026)
Beyond the worst case: Distortion in impartial culture electorates
by: Caragiannis, Ioannis, et al.
Published: (2023)
by: Caragiannis, Ioannis, et al.
Published: (2023)
Fair Rent Division: New Budget and Rent Constraints
by: Gangam, Rohith Reddy, et al.
Published: (2025)
by: Gangam, Rohith Reddy, et al.
Published: (2025)
Regret Analysis of Repeated Delegated Choice
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2023)
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2023)
Breaking the Metric Voting Distortion Barrier
by: Charikar, Moses, et al.
Published: (2023)
by: Charikar, Moses, et al.
Published: (2023)
Stable Matching with Interviews
by: Ashlagi, Itai, et al.
Published: (2025)
by: Ashlagi, Itai, et al.
Published: (2025)
Additively Competitive Secretaries
by: Mahdian, Mohammad, et al.
Published: (2026)
by: Mahdian, Mohammad, et al.
Published: (2026)
The General Expiration Streaming Model: Diameter, $k$-Center, Counting, Sampling, and Friends
by: Blank, Lotte, et al.
Published: (2025)
by: Blank, Lotte, et al.
Published: (2025)
Single-Sample Bilateral Trade with a Broker
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2026)
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2026)
Online Sampling and Decision Making with Low Entropy
by: Hajiaghayi, Mohammad Taghi, et al.
Published: (2021)
by: Hajiaghayi, Mohammad Taghi, et al.
Published: (2021)
Optimal Algorithms for Free Order Multiple-Choice Secretary
by: Hajiaghayi, Mohammad Taghi, et al.
Published: (2022)
by: Hajiaghayi, Mohammad Taghi, et al.
Published: (2022)
Barely Random Algorithms and Collective Metrical Task Systems
by: Cosson, Romain, et al.
Published: (2024)
by: Cosson, Romain, et al.
Published: (2024)
Gains-from-Trade in Bilateral Trade with a Broker
by: Hajiaghayi, Ilya, et al.
Published: (2024)
by: Hajiaghayi, Ilya, et al.
Published: (2024)
Stationary Online Contention Resolution Schemes
by: Aminian, Mohammad Reza, et al.
Published: (2026)
by: Aminian, Mohammad Reza, et al.
Published: (2026)
Condorcet Dimension and Pareto Optimality for Matchings and Beyond
by: Kavitha, Telikepalli, et al.
Published: (2026)
by: Kavitha, Telikepalli, et al.
Published: (2026)
Similar Items
-
Fairness and Efficiency in Online Class Matching
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2024) -
Bandit Social Learning: Exploration under Myopic Behavior
by: Banihashem, Kiarash, et al.
Published: (2023) -
Dynamic Metric Embedding into $\ell_p$ Space
by: Banihashem, Kiarash, et al.
Published: (2024) -
Replication-proof Bandit Mechanism Design with Bayesian Agents
by: Shin, Suho, et al.
Published: (2023) -
2-Approximation for Prize-Collecting Steiner Forest
by: Ahmadi, Ali, et al.
Published: (2023)