79 search results - page 3 / 16 » Deliberation in Equilibrium: Bargaining in Computationally C... |
104
Voted
IAT
2009
IEEE
15 years 4 months ago
2009
IEEE
Automating negotiations in markets where multiple buyers and sellers operate is a scientific challenge of extraordinary importance. One-to-one negotiations are classically studie...
ATAL
2007
Springer
2007
Springer
Coalition formation under uncertainty: bargaining equilibria and the Bayesian core stability concept
15 years 3 months ago
Coalition formation is a problem of great interest in AI, allowing groups of autonomous, rational agents to form stable teams. Furthermore, the study of coalitional stability conc...
104
click to vote
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
We consider the problem of finding optimal strategies in infinite extensive form games with incomplete information that are repeatedly played. This problem is still open in lite...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)
STACS
2007
Springer
15 years 3 months ago
2007
Springer
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...