Implications of Distance over Redistricting Maps: Central and Outlier Maps
Fuente:
arXiv
Saved in:
| Main Authors: | Esmaeili, Seyed A., Chakrabarti, Darshan, Grape, Hayley, Brubach, Brian |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Replication-proof Bandit Mechanism Design with Bayesian Agents
by: Shin, Suho, et al.
Published: (2023)
by: Shin, Suho, et al.
Published: (2023)
Envy-Free School Redistricting Between Two Groups
by: Shibatani, Daisuke, et al.
Published: (2026)
by: Shibatani, Daisuke, et al.
Published: (2026)
Facility Location Games Beyond Single-Peakedness: the Entrance Fee Model
by: Ma, Mengfan, et al.
Published: (2022)
by: Ma, Mengfan, et al.
Published: (2022)
Efficiency of Proportional Mechanisms in Online Auto-Bidding Advertising
by: Thang, Nguyen Kim
Published: (2026)
by: Thang, Nguyen Kim
Published: (2026)
Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples
by: Csáji, Gergely, et al.
Published: (2023)
by: Csáji, Gergely, et al.
Published: (2023)
Covering a Few Submodular Constraints and Applications
by: Bajpai, Tanvi, et al.
Published: (2025)
by: Bajpai, Tanvi, et al.
Published: (2025)
Gerrymandering Planar Graphs
by: Dippel, Jack, et al.
Published: (2023)
by: Dippel, Jack, et al.
Published: (2023)
Probing EFX via PMMS: (Non-)Existence Results in Discrete Fair Division
by: Byrka, Jarosław, et al.
Published: (2025)
by: Byrka, Jarosław, et al.
Published: (2025)
Equilibria, Efficiency, and Inequality in Network Formation for Hiring and Opportunity
by: Dwork, Cynthia, et al.
Published: (2024)
by: Dwork, Cynthia, et al.
Published: (2024)
Computing a Fixed Point of Contraction Maps in Polynomial Queries
by: Chen, Xi, et al.
Published: (2024)
by: Chen, Xi, et al.
Published: (2024)
Individual Rationality in Topological Distance Games is Surprisingly Hard
by: Deligkas, Argyrios, et al.
Published: (2024)
by: Deligkas, Argyrios, et al.
Published: (2024)
A Theoretical Model for Grit in Pursuing Ambitious Ends
by: Blum, Avrim, et al.
Published: (2025)
by: Blum, Avrim, et al.
Published: (2025)
Welfare-Centric Clustering
by: Zhang, Claire Jie, et al.
Published: (2025)
by: Zhang, Claire Jie, et al.
Published: (2025)
Robust Fair Clustering with Group Membership Uncertainty Sets
by: Duppala, Sharmila, et al.
Published: (2024)
by: Duppala, Sharmila, et al.
Published: (2024)
Fair Clustering: Critique, Caveats, and Future Directions
by: Dickerson, John, et al.
Published: (2024)
by: Dickerson, John, et al.
Published: (2024)
Breaking the Metric Voting Distortion Barrier
by: Charikar, Moses, et al.
Published: (2023)
by: Charikar, Moses, et al.
Published: (2023)
The complexity of approximate (coarse) correlated equilibrium for incomplete information games
by: Peng, Binghui, et al.
Published: (2024)
by: Peng, Binghui, et al.
Published: (2024)
Efficiently Solving Turn-Taking Stochastic Games with Extensive-Form Correlation
by: Zhang, Hanrui, et al.
Published: (2024)
by: Zhang, Hanrui, et al.
Published: (2024)
Regret Bounds for Competitive Resource Allocation with Endogenous Costs
by: Chai, Rui
Published: (2026)
by: Chai, Rui
Published: (2026)
Learning in Repeated Multi-Unit Pay-As-Bid Auctions
by: Galgana, Rigel, et al.
Published: (2023)
by: Galgana, Rigel, et al.
Published: (2023)
Anytime-Constrained Equilibria in Polynomial Time
by: McMahan, Jeremy
Published: (2024)
by: McMahan, Jeremy
Published: (2024)
Matchings Under Biased and Correlated Evaluations
by: Kumar, Amit, et al.
Published: (2025)
by: Kumar, Amit, et al.
Published: (2025)
Edge-weighted Online Stochastic Matching: Beating $1-\frac1e$
by: Yan, Shuyi
Published: (2022)
by: Yan, Shuyi
Published: (2022)
Online Resource Allocation with Cancellations
by: Ekbatani, Farbod, et al.
Published: (2022)
by: Ekbatani, Farbod, et al.
Published: (2022)
Truthful Matching with Online Items and Offline Agents
by: Feldman, Michal, et al.
Published: (2022)
by: Feldman, Michal, et al.
Published: (2022)
Approximating Nash Social Welfare by Matching and Local Search
by: Garg, Jugal, et al.
Published: (2022)
by: Garg, Jugal, et al.
Published: (2022)
Online Nash Welfare Maximization Without Predictions
by: Huang, Zhiyi, et al.
Published: (2022)
by: Huang, Zhiyi, et al.
Published: (2022)
Envy-freeness in 3D Hedonic Games
by: McKay, Michael, et al.
Published: (2022)
by: McKay, Michael, et al.
Published: (2022)
Opponent Indifference in Rating Systems: A Theoretical Case for Sonas
by: Bodwin, Greg, et al.
Published: (2022)
by: Bodwin, Greg, et al.
Published: (2022)
Condorcet Dimension and Pareto Optimality for Matchings and Beyond
by: Kavitha, Telikepalli, et al.
Published: (2026)
by: Kavitha, Telikepalli, et al.
Published: (2026)
Best of Both Worlds Guarantees for Equitable Allocations
by: Bhaskar, Umang, et al.
Published: (2025)
by: Bhaskar, Umang, et al.
Published: (2025)
Universal Online Contention Resolution with Preselected Order
by: Zhao, Junyao
Published: (2025)
by: Zhao, Junyao
Published: (2025)
The Min Max Average Cycle Weight Problem
by: Elmalem, Noga Klein, et al.
Published: (2025)
by: Elmalem, Noga Klein, et al.
Published: (2025)
Matching with Nested and Bundled Pandora Boxes
by: Bowers, Robin, et al.
Published: (2024)
by: Bowers, Robin, et al.
Published: (2024)
A Note on Approximating Weighted Nash Social Welfare with Additive Valuations
by: Feng, Yuda, et al.
Published: (2024)
by: Feng, Yuda, et al.
Published: (2024)
Online Job Assignment
by: Ekbatani, Farbod, et al.
Published: (2025)
by: Ekbatani, Farbod, et al.
Published: (2025)
Near-Feasible Stable Matchings: Incentives and Optimality
by: Glitzner, Frederik
Published: (2026)
by: Glitzner, Frederik
Published: (2026)
Additively Competitive Secretaries
by: Mahdian, Mohammad, et al.
Published: (2026)
by: Mahdian, Mohammad, et al.
Published: (2026)
Data Exchange Markets via Utility Balancing
by: Bhaskara, Aditya, et al.
Published: (2024)
by: Bhaskara, Aditya, et al.
Published: (2024)
Pandora's Problem with Combinatorial Cost
by: Berger, Ben, et al.
Published: (2023)
by: Berger, Ben, et al.
Published: (2023)
Similar Items
-
Replication-proof Bandit Mechanism Design with Bayesian Agents
by: Shin, Suho, et al.
Published: (2023) -
Envy-Free School Redistricting Between Two Groups
by: Shibatani, Daisuke, et al.
Published: (2026) -
Facility Location Games Beyond Single-Peakedness: the Entrance Fee Model
by: Ma, Mengfan, et al.
Published: (2022) -
Efficiency of Proportional Mechanisms in Online Auto-Bidding Advertising
by: Thang, Nguyen Kim
Published: (2026) -
Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples
by: Csáji, Gergely, et al.
Published: (2023)