Here's an idea about how to formally specify society-wide optimization, given that we know the utility function of each individual. In particular, it might be useful for multi-user AI alignment.
A standard tool for this kind of problem is Nash bargaining. The main problem with it is that it's unclear how to choose the BATNA (disagreement point). Here's why some simple proposals don't work:
Here is my proposal. We define the socially optimal outcome by recursion over the number of people n. For n=1, we obviously just optimize the utility function of the lone person. For a set of people P of cardinality n>1, let's consider any given i∈P. The BATNA payoff of i is defined to be the minimum over all j∈P of the payoff of i in the socially optimal outcome of P∖j (we consider worlds in which j doesn't exist). If there are multiple optimal outcomes, we minimize over them. Typically, the minimum is achieved for j=i but we can't just set j=i in the definition, we need the minimization in order to make sure that the BATNA is always admissible[1]. We then do Nash bargaining with respect to this BATNA.
Good properties of this proposal:
By "motivate bargaining", I meant that humans aren't rational utility maximizers, and the outcomes they will seek and accept are different, depending on the framing of the question. If you tell them that the rational baseline is low (and prove it using a very small set of assumptions), they're more likely to accept a wider range of better (but not as much better as pure manipulation might give them) outcomes.
By negative-value lives, I meant negative to the aggregate you're maximizing, not negative to themselves. Someone who gains by others' suf... (read more)