You want a general algorithm that plays arbitrary games against other copies of itself “fairly”. If utilities are transferable, it’s easy, but note that this solution wasn’t derived from consideration of logical correlations alone. If utilities are non-transferable, I’ve given up on the problem because the literature offers bewilderingly many different solutions and no clear winner.
You could try a simpler problem as a stepping stone: blame assignment. (I’m currently trying to solve this myself for a future post but what the hell, let a million flowers bloom.) In a given play of a multiplayer game, how much credit/blame should we assign to player A for the payoff that player B got? Concrete example: how many people did one voter personally kill by voting for Hitler and how is this responsibility shared between them and Hitler? I believe this should be easier than NTU fairness but it’s still too tricky for me.
It’s misleading when you are calling efficient decision-making “fairness”. It’s not about giving the poor an equal share, it’s about making sure you get the best deal there is. (And such an algorithm should be able to play arbitrary games not just against other copies of itself—by the way, what exactly is a copy is we don’t have a formal setting?)
Completely agreed on first point, I view it as something like “fairness according to bargaining power”.
what exactly is a copy is we don’t have a formal setting?
In a problem this hard, I still consider full source code visibility a reasonable starting point. I’ll be very suspicious if a proposed solution works in some other formal setting but doesn’t work under full source visibility.
You want a general algorithm that plays arbitrary games against other copies of itself “fairly”. If utilities are transferable, it’s easy, but note that this solution wasn’t derived from consideration of logical correlations alone. If utilities are non-transferable, I’ve given up on the problem because the literature offers bewilderingly many different solutions and no clear winner.
You could try a simpler problem as a stepping stone: blame assignment. (I’m currently trying to solve this myself for a future post but what the hell, let a million flowers bloom.) In a given play of a multiplayer game, how much credit/blame should we assign to player A for the payoff that player B got? Concrete example: how many people did one voter personally kill by voting for Hitler and how is this responsibility shared between them and Hitler? I believe this should be easier than NTU fairness but it’s still too tricky for me.
It’s misleading when you are calling efficient decision-making “fairness”. It’s not about giving the poor an equal share, it’s about making sure you get the best deal there is. (And such an algorithm should be able to play arbitrary games not just against other copies of itself—by the way, what exactly is a copy is we don’t have a formal setting?)
Completely agreed on first point, I view it as something like “fairness according to bargaining power”.
In a problem this hard, I still consider full source code visibility a reasonable starting point. I’ll be very suspicious if a proposed solution works in some other formal setting but doesn’t work under full source visibility.