4 citations · 6 across the 9 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2026
Avoiding the Worst: The Computational Complexity of Not Worst-Responding
Mete Şeref Ahunbay, Paul W. Goldberg, Edwin Lock +3
Finding, counting, or determining the existence of pure Nash equilibria, where players must play optimally given the others' actions, are known to be computationally intractable pr…
cs.GT2013
Agreeing on Decisions: An Analysis with Counterfactuals
Bassel Tarbush
Moses & Nachum ([7]) identify conceptual flaws in Bacharach's generalization ([3]) of Aumann's seminal "agreeing to disagree" result ([1]). Essentially, Bacharach's framework requi…