Sciweavers

62 search results - page 3 / 13
» Nash equilibrium and economics: Remarks
Sort
View
ICPP
2009
IEEE
14 years 2 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
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 5 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 1 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
MMB
2004
Springer
120views Communications» more  MMB 2004»
14 years 26 days ago
Equilibrium Market Prices for Multi-Period Auctions of Internet Resources
Auctions are a well-established mechanism for efficient allocation of scarce resources and as such have already become a standard approach for pricing QoS-enabled future Internet ...
Peter Reichl, Stefan Wrzaczek
SIGECOM
2005
ACM
117views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
First-price path auctions
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
Nicole Immorlica, David R. Karger, Evdokia Nikolov...