In the (famous) Trolley Problem (https://en.wikipedia.org/wiki/Trolley_problem) - a runaway train is out of control and unfortunate people are stuck on two different railway tracks. The railway conductor has a choice to make in deciding which track he should divert the train to:
To me, this sounds like a very (grim and depressing) optimization problem - but does anyone know if this problem has ever been studied from a mathematical perspective?
For example, suppose there are many trains, many tracks and many unfortunate people stuck on these tracks - theoretically, could this be interpreted as a very (grim and depressing) scheduling/allocation problem in which the goal is to decide which tracks to divert which trains to, such that the minimum number of victims are injured?
Is there any literature in which similar types of problems are studied, in which a general form of the Trolley Problem is specifically mentioned?

Otherwise, why would you even consider about such blatant thinkin?
In human terms, it could never matter how many trains or tracks there were; only the unfortunate people…
In mathematical terms, how many of anything should be all that mattered.
How are those perspectives comparable?
– Robbie Goodwin Mar 13 '22 at 21:38