You Can Have Your Cake and Redistrict It Too
Page 270
Abstract
The design of algorithms for political redistricting generally takes one of two approaches: optimize an objective such as compactness or, drawing on fair division, construct a protocol whose outcomes guarantee partisan fairness. We aim for the best of both worlds by optimizing an objective subject to a binary fairness constraint.
Index Terms
- You Can Have Your Cake and Redistrict It Too
Index terms have been assigned to the content through auto-classification.
Recommendations
Can CSMA/CA networks be made fair?
MobiCom '08: Proceedings of the 14th ACM international conference on Mobile computing and networkingWe demonstrate that CSMA/CA networks, including IEEE 802.11 networks, exhibit severe fairness problem in many scenarios, where some hosts obtain most of the channel's bandwidth while others starve. Most existing solutions require nodes to overhear ...
You can't bribe a computer: dealing with the societal challenge of corruption through ICT
Despite the influence of information and communication technologies (ICTs) on enhancing transparency and fairness, there is limited theoretical understanding of how ICT affects corruption. Adopting an institutional perspective, we conceptualize the ...
Can multiple subchannels improve the delay performance of RTS/CTS-based MAC schemes?
We analyze the delay performance of RTS/CTS-based (Request-To-Send/Clear-To-Send) multi-channel MAC (Medium Access Control) schemes for wireless networks. These schemes usually employ multiple data subchannels for data transmission and one control ...
Comments
Information & Contributors
Information
Published In
July 2023
1253 pages
ISBN:9798400701047
DOI:10.1145/3580507
- Chair:
- Kevin Leyton-Brown,
- Program Chair:
- Jason D Hartline,
- Program Co-chair:
- Larry Samuelson
Copyright © 2023 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 07 July 2023
Check for updates
Qualifiers
- Research-article
Conference
EC '23
Sponsor:
Acceptance Rates
Overall Acceptance Rate 664 of 2,389 submissions, 28%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 38Total Downloads
- Downloads (Last 12 months)23
- Downloads (Last 6 weeks)1
Reflects downloads up to 22 Sep 2024
Other Metrics
Citations
Cited By
View allView Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in