2018/03/02 by Solan, Eilon, Solan, Omri Nisan, Solan, Ron · 1 citation
#Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #FOS: Mathematics #Probability (math.PR)
paper · doi:10.48550/arxiv.1803.00802
We provide a mechanism that uses two biased coins and implements any distribution on a finite set of elements, in such a way that even if the outcomes of one of the coins is determined by an adversary, the final distribution remains unchanged. We apply this result to show that every quitting game in which at least two players have at least two continue actions has an undiscounted \ep-equilibrium, for every \ep > 0.