Can you construct a problem that defeats TDT that cannot be constructed to defeat CDT? (I think I can- The Pirates’ problem against psychological twins).
The CDT result is pretty well known: the first pirate gets almost everything.
The TDT result is hard for me, but if the first pirate gets anything then more than half of the other pirates had a strategy that could be trivially improved.
Can you construct a problem that defeats TDT that cannot be constructed to defeat CDT? (I think I can- The Pirates’ problem against psychological twins).
No, I don’t have any such thing in mind. Could you explain how TDT and CDT get different results?
The CDT result is pretty well known: the first pirate gets almost everything.
The TDT result is hard for me, but if the first pirate gets anything then more than half of the other pirates had a strategy that could be trivially improved.