Fun post. I'd be interested to know: How many consecutive Truth Booths (or: how many consecutive Match Ups) are needed to narrow down the 10! possibilities to a single one? Discussing "events" (ie, Truth Booth or Match Up) together muddles the analysis a bit. I agree with Medea above that a Truth Booth should give at most 1 bit of information.
If you can only check pairings one at a time I’m not sure it’s possible to do better than greedily solving one person at a time.
It's interesting how close 22.5 is to the 21.8 bits of entropy for 10!, and that has me wondering how often you would win if you followed this strategy with 18 truth booths followed by one match up (to maintain the same total number of queries).
Simulation suggests about 24% chance of winning with that strategy, with 100k samples. (I simplified each run to "shuffle [0..n), find index of 0".)