Sciweavers

594 search results - page 35 / 119
» Games with Secure Equilibria
Sort
View
UAI
2004
13 years 9 months ago
Computing Best-Response Strategies in Infinite Games of Incomplete Information
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
Daniel M. Reeves, Michael P. Wellman
FOCS
2010
IEEE
13 years 5 months ago
Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction
Generalized Second Price Auction, also knows as Ad Word auctions, and its variants has been the main mechanism used by search companies to auction positions for sponsored search l...
Renato Paes Leme, Éva Tardos
EL
2002
134views more  EL 2002»
13 years 7 months ago
Security issues in online games
The traditional target of computer game security is mainly copy protection. The emergence of online games fundamentally changes the security requirements for computer games. Althou...
Jianxin Jeff Yan, Hyun-Jin Choi
FOCS
2007
IEEE
14 years 2 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
ATAL
2007
Springer
14 years 1 months ago
Coalition formation under uncertainty: bargaining equilibria and the Bayesian core stability concept
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...
Georgios Chalkiadakis, Evangelos Markakis, Craig B...