Two friends A, B want to share a (circular) pizza, by playing a game.
A does a (straight line) cut
B also does a cut
A does another cut and
B does the last cut.
Now they alternate turns picking one slice at a time until last, starting from A.
Does B have a strategy (at least) not to eat less pizza?
I think the key is to make equal pieces, i.e. splitting the pizza in pairs of pieces of equal area.
Yes, $B\;$can achieve equality.
Assume the players are not allowed to make no cut (i.e., pass), but are allowed to make a cut which coincides with a previous cut.
After $A$'s first cut, let $B\;$make a cut, $l\;$say, along the perpendicular bisector of $A$'s cut.
Thereafter, for every cut that $A\;$makes, let $B\;$make a cut symmetrical about $l\;$to $A's$ cut (i.e., the same cut as $A$ except reflected about the line $l$). Note: It might coincide with $A$'s cut.
It follows that every final piece appears with even multiplicity, up to congruence, so in the worst case, as $A\;$chooses pieces, $B$'s next choice can at least match.
To illustrate @quasi's excellent answer:
After this, $A$ and $B$ can each take turns in taking the next biggest piece and end up with half a pizza each.
Like many card games (bridge, whist, 500, etc.) there is a bidding/cutting stage and a playing/selecting stage.
The required strategy boils down to the single/final cut stage - where the following player gets to choose a piece and thus the best strategy for cutting is to ensure an equal partition exists (as OP suggests). In this case since A always gets to choose first, B has to ensure balance. With N rounds the obvious equal partition criterion is that there exists a partitioning into two sets of N pieces with equal total area. Leaving 2N-1 pieces is bad because A can always choose at least as big a piece as B will get (greedy selection), and then gets an extra piece at the end.
The obvious way of achieving the equal partition criterion is for B to always cut so as to achieve even reflective symmetry (as explained by @quasi and illustated by @jam). Note that B must always achieve an even number of pieces so B's first cut must divide both segments left by A while ensuring matching sizes for each selection stage as A can always be greedy and get ahead, and B has to be able to catch up immediately or will never catch up (given A adopts a greedy strategy).
A greedy selection strategy is thus appropriate for B as well - always take the biggest remaining piece.
What happens if A achieves the symmetric equal partition criterion? Then if B is allowed to make no cut or repeat a cut that is a solution, otherwise any cut perpendicular to the axis maintains the criterion.
Note that this is a slightly more general (necessary and sufficient) strategy than that of quasi (for the generalization to N pairs of cuts). For example, it will sometimes be possible to enforce even symmetry along another axis than B's first cut - e.g. A's first cut if it is a diameter.
Note that I am familiar with other forms of this problem (literally - my family used this approach for "cakes" more often than pies or pizzas, not to mention the related problems for "treasure" where dividing rather than cutting).
At least 2 people, but the straight line cut need not be an unbounded line, but can for example create a sector (cut to an approximate centre where there is already a cut to or through the centre, e.g. an approximate diameter - used with round cakes). Once an initial cut has been made, anyone can choose to take a piece rather than cut.
At least 2 people, but each bar the last making a single cut, last choosing first and the rest choosing in the same order (they will always have at least one portion to choose from that they deem fair or better if they cut to make a fair segment (usually a problem involving rectangular cake and making full width cuts).
