9 ms·
A more precise title for article would be: "In Game Theory, No Clear, Universal, Fast Path to Equilibrium". And I'm not an expert in either field, but the arti
by ucaetano 9y ago
A more precise title for article would be: "In Game Theory, No Clear, Universal, Fast Path to Equilibrium".
And I'm not an expert in either field, but the article seems go steer pretty close to P=?NP. The article seems to acknowledge that "brute force" communications is a generic, universal way to solve every game, which could “take longer than the age of the universe”, thus being “completely useless, of course.”
On the other hand, a lot of games have "additional structure that greatly reduces the amount of information each player must communicate", so you can apply simplifications to solve them. In other words, use heuristics.
- sjg007 9y agoYes. People are looking at this. https://cstheory.stackexchange.com/questions/25148/why-is-computing-pure-nash-equilibria-np-complete https://cstheory.stackexchange.com/questions/25148/why-is-co...
- ucaetano 9y agoCool! Thanks for that, guess that my GT and complexity skills aren't that rusty!