Wednesday, December 12, 2018

Tabulation software

Hi all,

I've been thinking about how to run tournaments for many years and publishing articles on it. My published ideas have ranged from geographic mixing, logit scores, and new methods for strength-of-schedule pairing and constrained side equalization assignment.

I've finally gotten around to putting all the ideas into a single, programming-ready document. I'm putting it out there as a Creative Commons Attribution (BY) license, version 4.0. Please feel free to use any ideas contained herein, as long as you attribute me.

Tuesday, August 7, 2018

Approval voting and primaries

California and Washington both use the top-two, open primary method in their elections: voters get to pick from, regardless of party, any primary contender to go onto the general election. The top two vote getters in the primary, regardless of party, move on to the general. One consequence of this is that a party could get "locked out" of a particular race if none of its candidates qualify for the top two spots. As a result, the parties have been especially concerned with having too many candidates in a race and splitting its voters into too-small factions, thus depriving any of the party's candidates from making it onto the general ballot. See this article for a description of the problem.

There's a very easy, very simple fix for the second part of this problem: approval voting. Here's my two-sentence description of approval voting:

Each voter can put a check next to as many candidates as they approve of, leaving disapproved-of candidates blank. The candidate(s) with the most votes win(s).

That's it. Ballots look the same. It's not complicated to explain. And approval voting lends itself to virtually no strategic voting (i.e., faking your preferences on the ballot to try to induce your desired outcome to happen).

In the top-two primary, everything would work the same, except that voters wouldn't get one choice; they could vote for as many candidates as they like. ABBAs could vote for every ABBA candidate, and BeeGees could vote for every BeeGee candidate. Or ABBAs could vote for most ABBA candidates and some centrist BeeGees. Or a centrist could vote for some centrist ABBAs and some centrist BeeGees. Let's imagine a scenario in which a district is 51% ABBA voter and 49% BeeGees. Let's say each side nominates three candidates: A, B, and C for the ABBAs, and X, Y, and Z for the BeeGees.

In a hyper-partisan environment, 100% of ABBA voters approve of A, B, and C, and 0% approve of X, Y, and Z; vice versa for all the BeeGee voters. Because there are slightly more ABBA voters (51-to-49), therefore the top two candidates will always be some combination of A, B, and C (more on this in a second). The BeeGee would be locked out. However, this lock-out has nothing to do with how many candidates the BeeGees nominated. It would have happened whether they nominated two, three, four, or a hundred candidates. The lock-out is the result of the hyper-partisan environment, not the number of candidates nominated splitting the vote. No matter how many candidates the BeeGees nominate, they all get 49% of the vote and fall short of the general ballot.

Let's go back to that issue of which two of A, B, and C make the general ballot in the hyper-partisan environment. If it is truly a tie--all three got exactly the same number of votes--then some tie-breaking mechanism would have to be employed. They could draw straws, or the ABBA party chairperson could decide because all of the candidates are its own. But this three-way tie seems fairly unlikely. Would primary ABBA voters be so united in support of all three candidates that they give 100% approval to each? I guess this is an argument that such hyper-partisanship seems unlikely; it's more likely A gets 95% approval from ABBA voters, B gets 90%, and C gets 70% or some such split. If there aren't at least two of ABBA's candidates that get 100% approval from ABBA voters, it opens up the possibility that a BeeGees candidate can make it to the general election.

Furthermore, it seems unlikely that there are no unaffiliated voters exist and that none of the partisans ever cross-over. Even in today's highly partisan environment, people can and do split tickets, switch parties, and cross-over. (I reserve hyper-partisanship to mean zero behavior exists.) Some ABBA voters might approve of A, B, and Z. Some centrist voters might approve of B and X. Having unaffiliated voters and cross-over votes doesn't guarantee ABBA candidates or BeeGee candidates won't be locked out--but it does make it less likely. Even in a highly partisan environment, candidates with cross-over appeal might be at somewhat of a practical advantage. Winning 99% of 51% of the total votes (almost all ABBA voters) is 50.49% of the total; winning 90% of 51% of the total votes (most ABBA voters) and 10% of 49% of the total votes (a smattering of BeeGee voters) is 50.8% of the total votes. As a real-world matter, I think it's harder to get complete party unity behind a candidate (that is, 99%) than it is to attract a couple percentage points from the other party. Maybe I'm wrong, but look at this graph of presidential approval ratings. Of the twelve presidents of the modern era, nine were able to pick up more support from the opposition party than they lost from their own. Only two were better able at holding their own party together than at attracting opponents (Barack and the Donald). The twelfth case, Jimmy, did dismally with both parties. The average trend is that pulling in opposition is easier than preventing any defections.

In an approval voting scheme for a top-two primary, it's possible that a party gets locked out, but the cause would not be how few or many candidates they nominate. A party would get locked out if (1) the other party had more voters and had at least two candidates they completely unified behind or if (2) the other party had at least two candidates with cross-over appeal. Scenario 1 seems unlikely as an empirical matter; scenario 2 seems like it fulfills the exact purpose of top-two primaries of selecting the two best candidates overall--who just happen to be from the same party, but expanded their support beyond it.

By the way, the approval voting scheme makes sense for regular primaries too, or any time voters have more than two choices they need to whittle down. I use it in meetings whenever we have more than two options to consider to find out where the general consensus lays.

There's not much an individual voter can do to vote strategically. Some might consider giving an approval vote to the candidate I find least objectionable from the party I disagree with, if I think it's inevitable that the other party will get one candidate in. (In other words, it's inevitable, so chose the weakest opposition.) This seems an unlikely scenario, however, and a risky strategy. When do I know the other party is nearly guaranteed a spot in the general election? Only when my party has nominated only one candidate or only one strong candidate (so, unlikely). And it's a risky strategy: my approval vote for the weakest opposition might be enough to push TWO of the opposition party's candidates into the general election, excluding my candidate entirely. Let's say the standings look like this, including my vote for my candidate but not yet voting for the opposition candidate:

My candidate - 51%
Opposition candidate I hate - 49%
Opposition candidate I would prefer - 49%

In this case, I do get to decide which opposition candidate we face in the general election. But the scenario could just as easily be this:

My candidate - 49%
Opposition candidate I hate - 51%
Opposition candidate I would prefer - 49%

In this case, the opposition candidate I hate is inevitable. My vote for the opposition candidate I prefer knocks out my candidate. (At least before, my candidate might have won the tie-breaker for second place.)

Who can say which scenario is likely to happen in a close race before the voting is done? This strategy is incredibly risky when everyone votes before votes are tallied.

Friday, July 27, 2018

Random matching in debate tournaments

Every debater knows the predicted number of teams with each record when power-matching is used:

and so on. But how would it work without power-matching? What if teams were paired at random? The easy part is using the laws of probability to figure out which matches happen by chance. That's listed in column F.

The hard part is figuring out which team wins. If both teams have the same record, then whichever team wins, the outcome is the same. For example, in round two, the 25 teams in 1-0 vs. 1-0 rounds (ignore the fact that this is odd--it makes no difference in the end) and the 25 teams in 0-1 vs. 0-1 rounds guarantees that 12.5 teams will have a 2-0 record; 25 will be 1-1; and 12.5 will be 0-2. These guaranteed outcomes are listed in column I.

But what happens if the two teams have different records? One possibility is that there are no upsets at all. For example, in round two, of the 50 teams in 1-0 vs. 0-1 rounds, exactly half are 1-0s. These 25 teams might all win--no upsets--and become 2-0s. The 25 teams that are 0-1s all become 0-2s. These no-upset results are listed in column J.

The other possibility is that all rounds with mixed records have upsets. In round two, of the 50 teams with 1-0 vs. 0-1 rounds, the 25 teams that are 0-1s could all win, becoming 1-1s, while the 25 teams with 1-0s all lose, become 1-1s. Thus all 50 teams end up 1-1. These all-upset results are listed in column K.

Of course, neither no-upsets or all-upsets is realistic. From other research I've done, it turns out the upset rate is more like 20%, so I blended the two results 80:20 no-upsets:all-upsets in column L. As you can see, the ultimate outcome is that each record is nearly balanced with the others, though slightly more in the mediocre results. For example, after three rounds, a 20% upset rate results in about 17 teams that are 4-0s; 22 teams that are 3-1s; 23 teams that are 2-2s; etc.

Yet the 20% upset rate is probably conservative. It is unlikely that an 0-3 team has a 20% chance against a 3-0 team. As the teams are farther apart in record in later rounds, the overall upset rate must drop. If this is so, the final outcomes flatten. It turns out that if the upset rate is 1/6 for round two, drops to 1/8 for round three, and further drops to 1/10 for round four, then the final outcome is that exactly 20 teams are 4-0s; 20 are 3-1s; etc.

What happens if teams are paired at random? It depends on the upset rate. If it's exactly 50% (which is far too high), then the final outcomes look exactly like it would with power-matching:

If the upset rate is a more realistic, empirically justified 20%, then the outcomes are much flattened and nearly equally distributed:

Here's the sheet for anyone who'd like to play around with it.

Wednesday, May 16, 2018

Why debate tournaments have been doing side assignment wrong

Side assignment is easy, right? In odd rounds, assign teams to sides at random. In even rounds, assign each team to the opposite side as the previous round. What could be easier?

The problem is that this makes even rounds harder to pair. Any tournament director can tell you that even rounds often "lock up" and that one has to break brackets to make matches. I know I've sat at a screen, wishing the two 5-0s that are both due Aff could hit, instead of each getting a pull-up.

I stumbled on an alternative, what I call the constrained side equalization (C.S.E.) method. Instead of balancing Aff-Neg rounds at the end of even rounds, this method works its magic at the end of odd rounds. Here's the C.S.E. in action:

Rd 1 - paired at random
Rd 2 - paired at random, ignoring sides. If both teams were Aff in round 1, or both Neg in round 1, it's a computer flip-for-sides. If one team was Aff and the other was Neg, then the sides are equalized.

At the end of round 2, about 25% of teams will have two Affs, 25% two Negs, and 50% will be balanced. (It depends on the random pairings.)

Rd 3 - Teams with two Affs must go Neg; teams with Negs must go Aff. The balanced teams are not assigned to either side. If a balanced team is matched against a two-Aff team, then the two-Aff team goes Neg. Likewise, if a balanced team is matched against a two-Neg team, then the two-Neg team goes Aff. If a two-Aff team is matched against a two-Neg team, then the sides are equalized. And if a balanced team is matched against a balanced team, then it's a computer flip-for-sides.

At the end of round 3, every team will either have had two Affs and one Neg, or two Negs and one Aff. In other words, at the end of an odd round, the sides are "equalized."

The cycle repeats. Round 4 is paired at random, ignoring sides. Round 5 has the constraint that teams with three Affs must go Neg and teams with three Negs must go Aff; otherwise, any team can be paired against any other. If the tournament ends on an odd round, there's no special other consideration. If the tournament ends on an even round, you'd want to pair teams in the typical way for the final prelim.

Mathematically, it is as simple as this rule:
If the Aff rounds - Neg rounds is 2 or -2, then the team is assigned a side first, then paired with an opponent; otherwise, a team is assigned an opponent first, then assigned a side (to equalize if necessary).
This works in odd or even rounds.

But why go to all this bother? The reason is simple: constraints.

 OddEven Avg. 
 Trad. 100%50% 75% 
Alt.  87.5%100% 94% 

In a traditional method, in odd rounds, 100% of possible matches-- 0.5 * (n (n - 1)) --could be considered. There are no side constraints in odd rounds, so anyone could be matched against anyone. But in an even round, a tournament is limited to a fourth of (n (n - 1)). A due-Aff team can only be matched against a due-Neg team. This is a huge constraint.

Using the C.S.E. method, in odd rounds, teams with more Affs must go Neg and vice versa. Aside from this small constraint (only about one-eighth of possible matches ruled out), nearly anyone can debate anyone. And in even rounds, it's 100% of possible matches that can be considered. The C.S.E. method has much lower overall constraints than the traditional method.

In other words, the odd C.S.E. round is considerably easier to pair than the even traditional round (21 times better odds of finding a good pairing, in fact). If a side assignment for C.S.E. happens to not turn up a suitable pairing, why, you can reshuffle the teams--switching some randomly selected teams' side, excepting the couple side-constrained teams--and try again. This works whether it's an odd or an even round. In the traditional method, you can only reshuffle with an odd round. You're stuck with the even round side assignments you get with the traditional method. This inability to reshuffle the teams means the tournament can lock up. In the C.S.E. method, because any round can be reshuffled, there's always another chance to find a good pairing.

I worked out an example here. At the end of five rounds of C.S.E., every team had either two or three Affs. The method yielded side "equivalence."

But, intriguingly, the teams took different paths to get there. Some went Aff two times in a row. Some alternated. Although all the paths end with one of two correct results--two or three Affs--there were more path types to get there and thus more options to pair the teams. More paths = more flexibility. We've been doing side assignment the hard way!

Saturday, April 7, 2018

Experimental verification of the logit score

One method for ranking teams that I introduced to the debate community is the logit score. The logit score is derived from a logistic regression. The logit score combines a team's record, speaker points, and its opponents' strength into a single number. Because the logit score factors in record and points, it is performance-based, but that record is adjusted by opponent strength, making the logit score more fair than record alone. A win against a good team is "worth" more than a win against a weak team. If you take the worst opponent a team beat and the best opponent it lost to, and average those together along with the team's average speaker points, then you're approximating the team's logit score. Due to how the logit score is calculated, it is the likeliest team strength that explains its results: its record and its points.

I had previously looked for empirical support for the logit score in a college debate season. I took the real results for the entire season and used them to calculate each team's logit score. I then used those to retrodict the winner in every single match-up that had actually happened, with the higher ranked by logit score team retrodicted to win the round. The logit score did this better than every other ranking method I also tested, slightly edging out median speaker points, and doing better by a goodly margin than the win-loss record. Despite this success, there was the nagging concern that the logit score was being derived from an entire season's worth of information. This empirical support could not show if the logit score would work for a single tournament.

Therefore I set out to do an experiment. I created a simulation tournament in a program, and ran and re-ran it hundreds of times. I tested various tournament conditions, from random prelims to a typical method of power-matching to pre-matching (like a round robin). I looked to see whether in these kind of conditions--using only the information available in a tournament--the logit score fared as well in comparison to record-based rankings and to speaker point-based rankings.

The results are that, in any condition, the logit score is a vast improvement on the win-loss record, but not quite as good as speaker points. It may surprise people to realize that speaker points, even though they vary considerably from judge to judge, are the best information to rank teams. A team's median speaker points isn't affected too much by one judge. Speaker points are rich data when you only have six or eight rounds to rank a team.

However, I believe many in the community would not prefer to use speaker points alone. If nothing else, ignoring wins and losses gives a perverse incentive to teams to speak pretty and ignore winning key arguments. The logit score is a solid, thoughtful compromise. The logit score is based on both wins and points, so there's no perverse incentive to ignore key arguments--nor is there an incentive to ignore effective, mellifluous communication. Although the logit score is slightly less accurate for a single tournament than speaker points alone, the logit score is far more accurate than win-loss record is. The logit score is, in other words, a vast improvement on the status quo method--a compromise in name only.

Saturday, November 11, 2017

Mixed member House

I've written about gerrymandering before (and solutions to it), but the more I think about it, the best way to fix the problem is to remove the incentive. Proportional representation is good (and here), but the simplest change to the system is mixed member representation.

Here's how the system could work:

  1. Expand the size of the House to 540 districted members. This means the smallest district (Wyoming's) is everyone's size--about 600,000 constituents. The current number of House districts--435--has been fixed since 1911. Some things have changed since then... (I guess this isn't strictly necessary to a mixed-member system.)
  2. Have independent commissions in each state draw the districts, with a first priority to keep communities of interest together, although districts need to have the same 600,000 people, so it won't be perfect. This means you'll have some heavily African-American districts, heavily Latino districts, and big rural districts. Geographical compactness can take a back seat. Yes, that's right--we might have some ugly, squiggly districts. Trust me, this will work. Independent commissions' proposal should be approved by 2/3 of the votes in the state legislature, which should be easily achieved because everyone can recognize that districts are reasonable communities of interest.
  3. Modify ballots to include two questions for the House races: (a) Which candidate do you support for your House district? This could use approval voting to allow selection of more than one candidate in multi-candidate races. (b) Which party would you like to see control the House? This must be a single selection.
  4. Winners on question 1 win their district and get the seat. Because of the way we've drawn the districts, we're more likely to see black representatives run and get elected, Latino representatives, etc.
  5. We've got district races done and can look at the composition of the entire House so far. For example, the House might be 290 seats for party A, 250 for party B. This establishes the seat share for party A of 53.7%. In the next stage--the mixed member part--votes on question 2 are now compiled nationally. If the vote share and the seat share are not the same, then the party that is underrepresented in the House has at-large seats added. Seats are added until the seat share is within 1% of the vote share. In our example, let's say party A won 55% of the vote. Party A would have 4 seats added: 294 out of 544 seats is 54.04%. If two or more parties are underrepresented, whichever one is farther behind has a seat added first. Two parties might ping-pong back and forth in adding seats.
  6. Once the total number of at-large seats each party gets is decided, then those new members are selected. The at-large members are chosen from the party's candidates who lost but received the most votes. In other word, party A's four additional seats would go to whichever of its candidates lost very close district races.

Stop and think about the incentives of this proposal. There's actually a triple incentive to draw fair districts. Independent commissions want to get the districting plans to supermajority status; there's no reason to draw unfair districts, as you'll lose any gains in the at-large seats part of the plan; and having several competitive districts might increase your state's representation in Congress. States would want to draw at least a few competitive districts to get one over on the neighboring states.

In theory, it's possible that you have to seat 519 additional members (party A wins 49.9999% percent of national House votes but loses every single district race), but in all likelihood, we're talking about an extra 5% of seats--perhaps 20-30 additional seats. Altogether, a 570-member House is about 30% larger than today's. It's big but still manageable. And it's gerrymander-proof. The incentive to gerrymander disappeared.

And here's the most exciting part: You can vote for a third-party to have seats in Congress, even if no one runs (or has a shot) in your district. Let's say you want to vote for the Democratic candidate but throw your party support to the Greens. Or for the Republican candidate and put party support behind the Libertarians. Nationally, those parties will pick up enough votes to amount to at least a few seats. All they have to do is field some candidates in some districts, who will lose, but get picked up in the at-large representatives process.

My hope would be that third parties win enough support to deny either of the two major parties an outright majority, forcing the major parties to form coalition governments with third parties. Suddenly, we're looking at a system that doesn't freeze third parties out of power entirely; we're looking at a system that gives third parties enough seats in Congress to be involved in some leadership decisions. Support for a major party's Speaker might come at the cost of a committee leadership position. The Green party might demand leadership of the Natural Resources committee to support a Democratic speaker. The Libertarian party might demand leadership of Judiciary to support a Republican speaker. It seems likely, though, that this system creates more third party involvement.

Thursday, March 23, 2017

Naming streets

I believe in that simple things done right are the bedrock of society: the bus line that's always running; the convenience store around the corner that's never out of bread, milk, or toilet paper, even during the worst snowstorms; or the reliable local newspaper. But there's perhaps no greater collective failure in this country than our massively incompetent ability to name streets properly. Naming streets should be as simple as 1-2-3:

  1. A contiguous street gets a single name.
  2. A name is used only on one street per city.
  3. Name them in a pattern that's helpful for navigation.

To be clear, I'm talking about street names, not route designations, like U.S. 52 or State Route 39. A road could have a street name as well as a route designation, or even two route designations or more if geography forces the routes to consolidate for a stretch: Johnson Pass Rd. could be U.S. 52 and S.R. 39 all at the same time.

These rules seem clear, right? Rule 1 requires a little definition: a "street" may pass through multiple intersections in a straight or gently curving manner but must actually cross the other street. In other words, a "street" doesn't take a right angle at an intersection. Rule 2 requires a little clarification; let's allow "Maple Avenue" and "Maple Place" as two separate names, provided that they follow rule 3 by being close together--maybe even intersecting. But I don't believe cardinal indicators--"West Maple Avenue" and "East Maple Avenue"--ought to be allowed for separate streets. Those should be reserved for different sections of the same road.

The most common way the rules are violated is that two non-contiguous streets will get the same name. On a map, they're a straight shot, right in line with each other, but maybe there's a natural obstacle in the way, like a river. If I can't drive (or at least walk) from one end to another without turning, it's not one street; it's two. Give the two streets on the opposite river banks two different names.

You may think this doesn't seem like a big deal, but maybe I'll change your mind when I present to you the worst named street in the United States: Old Hickory Boulevard in Nashville, Tennessee. Look upon these maps and despair for your sanity. Our journey begins at Whites Creek, to the north of Nashville.

Crossing Eatons Creek Rd:

Crossing route 12, you may start to get an ominous feeling, noticing the Cumberland River to both the west and east:

Sure enough, you've hit a dead end:

This is west of Nashville.

Old Hickory Boulevard now jumps the river:

Please note: route 251 south of Old Charlotte Pike is Old Hickory Boulevard. Route 251 north of Old Charlotte Pike is a different road.

Old Hickory Boulevard jumps here, and gets a new route designation: route 254.

Next, OHB meanders along the south side of Nashville. Granny White is not exactly due south, but pretty close.

OHB now winds through Brentwood.

True story: I remember sitting in a Pargo's in Brentwood as a child when a tourist came into the restaurant in tears. "I've driven from one end of Old Hickory Boulevard to the other and I can't find this address!"

The manager took one look at her address. "Oh, this address is Whites Creek. That's the north side of town. This here's the south side." Hope you aren't in a hurry...

Now, watch what happens carefully after crossing 41A.

Did you see it? Old Hickory, which was route 254, took a right turn. Route 254 is now Bell Road.

OHB takes another jump:

As far as I can tell, that little section there is Pettus Rd.

Keep your eyes peeled:

Boom! Another right turn for you! Can't you just imagine a couple driving south on Old Hickory after getting off I-24 and the navicomputer is telling them to turn right onto OHB?

"But TomTom, I'm already on Old Hickory!" as they just breeze right onto Burkitt Road.

Maybe they'd have better luck if they got off I-24 going north on Old Hickory?


BTW, Route 171 is now the third route designation. So what happens after that right turn off 171?

Old Hickory Boulevard vanishes at the star. The road used to continue, but then T.V.A. built a dam on the Cumberland river, creating Percy Priest lake to the southeast of Nashville. A section of OHB still exists under that lake. Does it confuse boat tourists as much as the land sections confuses car tourists?

Wait, Old Hickory was a ring road. Does it continue on the other side?

Hello? Anyone seen a crappily named road?

Oh, there you are!

And another jump!

And we're back on solid land. You'll notice Old Hickory now has its fourth route designation, route 265.

We'll just cross I-40. Now you'll recall that OHB already crossed I-40 once before (when OHB was route 251). That means we're now on the opposite side of Nashville: the east.

We just follow OHB north for a bit.

Hermitage, by the way, is the name of Andrew Jackson's house/plantation. Andrew Jackson was nicknamed Old Hickory because he was nuttier than a squirrel's poop.

Let's see... we'll just keep going north.

"Wait, WTF? We're on route 45 now? I thought we were on route 265... We must've changed back there. TomTom still says we're on Old Hickory, hon. Good ole Old Hickory won't let us down, right?"

OHB, now route 45, takes a northwest hook here because of the Cumberland river on both sides. (Like Old Hickory, it's everywhere in Nashville.) Here's the map:

"Oh look, dear, there's a neighborhood called Old Hickory! Oh, how cute."
"Son of a..."

Now, it happens to be worth zooming in a little bit on Lakewood neighborhood first:

That's right, folks. It has two names. Hadley Avenue and OHB. It's officially broken all the simple naming convention rules and spiked the ball in the end zone.

But now, let's see what happens a little to the north, in Old Hickory neighborhood:

Nothing good for our tourists. OHB just disappears. (Hadley Avenue, the jerk, continues to the right.) Why is the neighborhood called "Old Hickory" when Old Hickory Boulevard doesn't run through it!!

Where did that wascally street go?

Oh, it magicked itself across its eponymous neighborhood. Right. To be clear, that whole section of route 45 I haven't marked is all Robinson Road. All the time. Sure, the locals who are just running down to the Piggly Wiggly know they turn on OHB which then becomes Robinson. But streets aren't named for locals, are they?

In case you're wondering, Old Hickory Community is where all the lost tourist children go to live, if their mums or dads can't navigate the streets of Nashville and pick them up by closing time.

Surely, surely, surely, OHB has pulled its last trick?

This one is a doozy. You'll notice an East Old Hickory Boulevard to the south of route 45. That's odd. Why would the East OHB be south of regular OHB?

Because route 45 ain't OHB any more.

East OHB is it. The best part is what happens inside that star. The name jumps from 45 to the surface street--but there's no physical connection. (Also, let's point out the East OHB goes around its corner, and that non-intersection changes its name to Sandhurst Drive.)

"Getting lost is... just a way to have an adventure, dear! Just... um, wasn't planning this and we're low on gas..."
"Oh look, hon, an Old Hickory Community. Maybe they can help us!"

If there's an East OHB, is there a West OHB? Indeed there is:

but you gotta take another jump.

OHB is nearly out of tricks, though:

At the star, it changes names from West OHB just back to plain vanilla Old Hickory Boulevard. BTW, crossing I-65 a second time means that we're on the north side of Nashville again.

A few more miles--crossing I-24 a second time--and we're back to Whites Creek:

You can almost hear the tourists wailing: "I just wanted... [sob] just to see... some country music stars' homes! I didn't want to drive all around creation!"
"And where are our children?!"

Let's do the numbers:

Route designations: Five (251, 254, 171, 265, and 45)
Two street names simultaneously: Yes (OHB and Hadley)
Street takes a right turn: Three times (all between 41A, I-24, and 171 in southeast Nashville)
Jumps over water: Three (Cumberland river, Percy Priest lake twice)
Jumps over other roads: Four (251 to 254; over Pettus Rd.; from route 45 to East OHB; from East OHB to West OHB)
Jumps over neighborhoods: One--but double points because it's eponymous
Switching names while driving down the same street, not otherwise covered: Two (West OHB turning back into OHB; East OHB turning into Sandusky Rd. The West OHB to regular OHB could be OK, I guess... No one is going to get lost if the numbering makes sense... which it doesn't.)

I think this deserves a total of 15 naming violation points: +1 for two names simultaneously, +3 for right turns, +9 for jumps, +2 for two name switches. (Or maybe 14 points, if you're cool with West OHB to OHB.)

I defy anyone to come up with a worse named street in the U.S. Map-based proof required.

BTW, in case you couldn't tell, I'm originally from Nashville. No offense is intended; I think it's fair to poke a little fun at your hometown.