Sciweavers

55 search results - page 6 / 11
» On the Complexity of Nash Equilibria and Other Fixed Points
Sort
View
LICS
1999
IEEE
13 years 11 months ago
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
Albert Atserias, Phokion G. Kolaitis
INFOCOM
2011
IEEE
12 years 11 months ago
Pricing-based spectrum access control in cognitive radio networks with random access
Abstract—Market-based mechanisms offer promising approaches for spectrum access in cognitive radio networks. In this paper, we focus on two market models, one with a monopoly pri...
Lei Yang, Hongseok Kim, Junshan Zhang, Mung Chiang...
WIOPT
2010
IEEE
13 years 5 months ago
Routing games : From egoism to altruism
The paper studies the routing in the network shared by several users. Each user seeks to optimize either its own performance or some combination between its own performance and tha...
Amar Prakash Azad, Eitan Altman, Rachid El Azouzi
HICSS
2002
IEEE
89views Biometrics» more  HICSS 2002»
14 years 13 days ago
Nash Strategies for Load Serving Entities in Dynamic Energy Multi-markets
In this paper the problem of developing bidding strategies for the participants of dynamic energy-multi markets is studied. Attention is given to strategic bidding of load serving...
Jose B. Cruz Jr., Ashkan Kian
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
14 years 1 months ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman