Steven Orla Kimbrough
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Steven Orla Kimbrough has a total of 46 co-authors. Here are the top co-authors by number of shared publications:
Frederic Murphy
Temple University
6 shared publications- Christine Chou
Department of International Business, National Dong Hwa University, Hualien, Taiwan
4 shared publications Christof Weinhardt
Karlsruhe Institute of Technology
3 shared publications- Frederic H. Murphy
Marketing and Supply Chain Management, Fox School of Business, Temple University, Philadelphia, Pennsylvania 19122
3 shared publications - Lee Hachadoorian
Temple University
3 shared publications - Peter Miller
University of California, Irvine
3 shared publications
Latest Publications
- 3 June 2026
- Published by SAGE Publications in American Politics Research
- Vol. 54 (6) , 686-703
Finding Pareto Dominant Redistricting Plans Using DEA: A Comparison With Ranking by Human Judges
Changing technology now allows for increased citizen participation in the redistricting process. Bodies responsible for redistricting, including legislatures, commissions, and courts, will need new analytical methods to evaluate large numbers of maps. We propose the use of data envelopment analysis (DEA) as a decision-support tool that will help evaluators identify high quality maps proposed by citizens and citizen groups. DEA does not rely upon an a priori ranking of redistricting criteria, but scores maps based on the values that emerge from the pool of submitted maps. We apply DEA to 403 maps submitted to Draw the Lines (DTL) , a series of redistricting contests held in Pennsylvania prior to the 2021 redistricting round. We compare DEA scores with contest outcomes, in particular comparing high scoring maps and semifinalists chosen by DTL judges. We explore the incomplete overlap between the maps that performed well in the contest and those that scored highly on DEA. We argue that DEA can aid in reducing the number of maps to be considered by human judges, for any process in which a large number of maps, whether created by humans or computers, must be evaluated for the selection of a final redistricting plan. These include public contests, public comment to legislatures and redistricting commissions, and, increasingly, cases in which the courts have had to select redistricting plans after the failure of the political process.
- 3 June 2026
- Published by SAGE Publications in American Politics Research
- Vol. 54 (6) , 686-703
Finding Pareto Dominant Redistricting Plans Using DEA: A Comparison With Ranking by Human Judges
Changing technology now allows for increased citizen participation in the redistricting process. Bodies responsible for redistricting, including legislatures, commissions, and courts, will need new analytical methods to evaluate large numbers of maps. We propose the use of data envelopment analysis (DEA) as a decision-support tool that will help evaluators identify high quality maps proposed by citizens and citizen groups. DEA does not rely upon an a priori ranking of redistricting criteria, but scores maps based on the values that emerge from the pool of submitted maps. We apply DEA to 403 maps submitted to Draw the Lines (DTL) , a series of redistricting contests held in Pennsylvania prior to the 2021 redistricting round. We compare DEA scores with contest outcomes, in particular comparing high scoring maps and semifinalists chosen by DTL judges. We explore the incomplete overlap between the maps that performed well in the contest and those that scored highly on DEA. We argue that DEA can aid in reducing the number of maps to be considered by human judges, for any process in which a large number of maps, whether created by humans or computers, must be evaluated for the selection of a final redistricting plan. These include public contests, public comment to legislatures and redistricting commissions, and, increasingly, cases in which the courts have had to select redistricting plans after the failure of the political process.
- Open Access
- 4 February 2026
- Published by Elsevier in Applied Energy
- Vol. 409
Aggregator electricity price guarantees for households with flexibility potential utilizing thermal building inertia
- 4 February 2026
- Published by Elsevier in Applied Energy
- Vol. 409
Open AccessAggregator electricity price guarantees for households with flexibility potential utilizing thermal building inertia
- 12 October 2025
- Published by Springer Nature
- p. 115-138
On Representing Knightian Uncertainty in Agent-Based Models
- 12 October 2025
- Published by Springer Nature
- p. 115-138
On Representing Knightian Uncertainty in Agent-Based Models
- 9 November 2024
- Published by Springer Nature
- p. 18-37
Agent-Based Foraging or When Imperfect Unbiased knowledge Yields Systematic Deviation from Ideally Rational Outcomes
- 9 November 2024
- Published by Springer Nature
- p. 18-37
Agent-Based Foraging or When Imperfect Unbiased knowledge Yields Systematic Deviation from Ideally Rational Outcomes
Selecting good redistricting plans from a large pool of available plans using the efficient frontier
- Open Access
- 26 August 2022
- Published by Elsevier in Electoral Studies
- Vol. 79
An algorithmic approach to legislative apportionment bases and redistricting
- 26 August 2022
- Published by Elsevier in Electoral Studies
- Vol. 79
Open AccessAn algorithmic approach to legislative apportionment bases and redistricting
- 13 July 2022
- Published by Elsevier in Applied Energy
- Vol. 323
Power-to-gas: Decarbonization of the European electricity system with synthetic methane
- 13 July 2022
- Published by Elsevier in Applied Energy
- Vol. 323
Power-to-gas: Decarbonization of the European electricity system with synthetic methane
- 29 March 2022
- Published by Springer Nature
- p. 23-42
On Modeling Evolution in Continuous Spaces
- Open Access
- 1 January 2022
- Published by Elsevier in SSRN Electronic Journal
Selecting Good Redistricting Plans from a Large Pool of Available Plans Using the Efficient Frontier
As part of a widespread frustration with partisan gerrymandering, many states have considered or implemented redistricting reforms—and others will eventually have to—that include a higher degree of citizen participation in proposing and evaluating redistricting plans. In some states without redistricting reform, public interest groups have created shadow commissions that encourage citizens to submit their own maps. For example, the new map for Pennsylvania Congressional districts, chosen by the state Supreme Court, was proposed by a citizens group.As citizen participation grows, analytical methods for rating plans that recognize the different mapping criteria are needed to sort through multiple maps, both for highlighting good maps and for providing measures that allow courts to rule that a map is gerrymandered. Using a modified version of data envelopment analysis (DEA), we present a nonpartisan approach that can score maps while not imposing any prior weights on the criteria. Our modification measures how close a plan is to the convex hull of the Pareto frontier when bigger is better for some criteria and smaller is better for others. Thus, thus we provide a novel and scalable way to filter out poor plans from large corpora of redistricting plans.
- 1 January 2022
- Published by Elsevier in SSRN Electronic Journal
Open AccessSelecting Good Redistricting Plans from a Large Pool of Available Plans Using the Efficient Frontier
As part of a widespread frustration with partisan gerrymandering, many states have considered or implemented redistricting reforms—and others will eventually have to—that include a higher degree of citizen participation in proposing and evaluating redistricting plans. In some states without redistricting reform, public interest groups have created shadow commissions that encourage citizens to submit their own maps. For example, the new map for Pennsylvania Congressional districts, chosen by the state Supreme Court, was proposed by a citizens group.As citizen participation grows, analytical methods for rating plans that recognize the different mapping criteria are needed to sort through multiple maps, both for highlighting good maps and for providing measures that allow courts to rule that a map is gerrymandered. Using a modified version of data envelopment analysis (DEA), we present a nonpartisan approach that can score maps while not imposing any prior weights on the criteria. Our modification measures how close a plan is to the convex hull of the Pareto frontier when bigger is better for some criteria and smaller is better for others. Thus, thus we provide a novel and scalable way to filter out poor plans from large corpora of redistricting plans.