Sciweavers

108 search results - page 6 / 22
» Computational Methods for Oblivious Equilibrium
Sort
View
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
68
Voted
MOR
2010
108views more  MOR 2010»
14 years 8 months ago
Accuracy Certificates for Computational Problems with Convex Structure
The goal of the current paper is to introduce the notion of certificates which verify the accuracy of solutions of computational problems with convex structure; such problems inc...
Arkadi Nemirovski, Shmuel Onn, Uriel G. Rothblum
ICPP
2009
IEEE
15 years 4 months ago
Computing Equilibria in Bimatrix Games by Parallel Vertex Enumeration
—Equilibria computation is of great importance to many areas such as economics, control theory, and recently computer science. We focus on the computation of Nash equilibria in t...
Jonathan Widger, Daniel Grosu
CORR
2006
Springer
105views Education» more  CORR 2006»
14 years 9 months ago
Employing Trusted Computing for the forward pricing of pseudonyms in reputation systems
Reputation and recommendation systems are fundamental for the formation of community market places. Yet, they are easy targets for attacks which disturb a market's equilibriu...
Nicolai Kuntze, Dominique Maehler, Andreas U. Schm...
MP
2006
110views more  MP 2006»
14 years 9 months ago
Robust game theory
We present a distribution-free model of incomplete-information games, both with and without private information, in which the players use a robust optimization approach to contend ...
Michele Aghassi, Dimitris Bertsimas