作者: Ittai Abraham , Danny Dolev , Rica Gonen , Joe Halpern
关键词: Game theory 、 Computer science 、 Nash equilibrium 、 Theoretical computer science 、 Computation 、 Best response 、 Secret sharing 、 Distributed computing 、 Secure multi-party computation 、 Rational agent
摘要: We study k-resilient Nash equilibria, joint strategies where no member of a coalition C size up to k can do better, even if the whole defects. show that such equilibria exist for secret sharing and multiparty computation, provided players prefer get information than not it. Our results hold there are only 2 players, so we computation with two rational agents. extend our they in presence t "unexpected" utilities. Finally, techniques be used simulate games mediators by without mediators.