Redistricting using Blockchain Network

Adhikari, Naresh; Bushra, Naila; Ramkumar, Mahalingam

doi:10.1109/tps-isa48467.2019.00026

Cited by 1 publication

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…strategy in [38]. The salient differences between the two stem from a new strategy for point-location queries proposed in [34].…”

Section: Creating and Verifying Proposalsmentioning

confidence: 99%

“…In [38] the strategy for verifying that there are no intersections between lines of a polygon, used the traditional algorithmic approach (sweep-line) [39] with ( ) log n n  complexity for n points. A state-machine model of this process will also call for ( )…”

Section: Creating and Verifying Proposalsmentioning

confidence: 99%

Section: Creating and Verifying Proposalsmentioning

confidence: 99%

“…Secondly, apart from being more efficient compared to [38], the end result of the transactions, viz., creation of "map" like structures r ξ for every polygon, can be used for purposes other than redistricting, for example, determine in which block/district a particular point ( ) , x y falls [34]. Finally, this paper addresses a minor flaw in [38]. Validating the district/state area merely by "walking" around the district/state boundary (incremental area computation using Equation ( 2)), and by adding up all block/district areas, still opens up the possibility of being able to swap a block inside the district with an equal area block outside the district.…”

Section: Creating and Verifying Proposalsmentioning

confidence: 99%

“…Validating the district/state area merely by "walking" around the district/state boundary (incremental area computation using Equation ( 2)), and by adding up all block/district areas, still opens up the possibility of being able to swap a block inside the district with an equal area block outside the district. By constructing bounding box maps and checking at that least one point from every included block actually lies inside the district, this flaw in [38] is addressed in this paper.…”

Section: Creating and Verifying Proposalsmentioning

confidence: 99%

See 4 more Smart Citations

Blockchain Based Redistricting with Public Participation

Ramkumar,

Adhikari

2022

JIS

Self Cite

View full text Add to dashboard Cite

Redistricting is the process of grouping all census blocks within a region to form larger subdivisions, or districts. The process is typically subject to some hard rules and some (soft) preferences to improve fairness of the solution. Achieving public consensus on the fairness of proposed redistricting plans is highly desirable. Unfortunately, fair redistricting is an NP hard optimization problem. The complexity of the process makes it even more challenging to convince the public of the fairness of the proposed solution. This paper proposes a completely transparent blockchain based strategy to promote public participation in the redistricting process, to increase public confidence in the outcome of the process. The proposed approach is based on the fact that one does not have to worry about how the NP hard problem was solved, as long as it is possible for anyone to compute a "goodness" metric for the proposed plan. In the proposed approach, anyone can submit a plan along with the expected metric. Only the plan with the best claimed metric needs to be evaluated in a blockchain network.

show abstract

“…strategy in [38]. The salient differences between the two stem from a new strategy for point-location queries proposed in [34].…”

Section: Creating and Verifying Proposalsmentioning

confidence: 99%

Section: Creating and Verifying Proposalsmentioning

confidence: 99%