Sciweavers

218 search results - page 8 / 44
» Subexponential Algorithms for Unique Games and Related Probl...
Sort
View
DM
2010
90views more  DM 2010»
13 years 7 months ago
Knights, spies, games and ballot sequences
This paper solves the Knights and Spies Problem: In a room there are n people, each labelled with a unique number between 1 and n. A person may either be a knight or a spy. Knights...
Mark Wildon
CDC
2009
IEEE
118views Control Systems» more  CDC 2009»
14 years 3 days ago
Nash equilibrium problems with congestion costs and shared constraints
Abstract— Generalized Nash equilibria (GNE) represent extensions of the Nash solution concept when agents have shared strategy sets. This generalization is particularly relevant ...
Huibing Yin, Uday V. Shanbhag, Prashant G. Mehta
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 6 months ago
Complexity of Decoding Positive-Rate Reed-Solomon Codes
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
Qi Cheng, Daqing Wan
CDC
2010
IEEE
117views Control Systems» more  CDC 2010»
13 years 2 months ago
Distributed iterative regularization algorithms for monotone Nash games
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
Aswin Kannan, Uday V. Shanbhag
COCOON
2008
Springer
13 years 9 months ago
Spectrum Bidding in Wireless Networks and Related
In this paper, we study the spectrum assignment problem for wireless access networks. Opportunistic spectrum usage is a promising technology. However, it could suffer from the self...
Xiang-Yang Li, Ping Xu, ShaoJie Tang, Xiaowen Chu