Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

STOC
2007
ACM

favoriteEmaildiscussreport

87views Algorithms» more STOC 2007»

The communication complexity of uncoupled nash equilibrium procedures

14 years 11 months ago

The communication complexity of uncoupled nash equilibrium procedures

Download www.cs.tau.ac.il

Sergiu Hart, Yishay Mansour

Real-time Traffic

Algorithms | STOC 2007 | Uncoupled Nash Equilibrium |

claim paper

Related Content

» Bounded Rationality Strategy Simplification and Equilibrium

» Communication complexity as a lower bound for learning in games

» InterferenceAware MAC Protocol for Wireless Networks by a GameTheoretic Approach

» Equilibria in topology control games for ad hoc networks

» A priceanticipating resource allocation mechanism for distributed shared clusters

» Dogfight in Spectrum Jamming and AntiJamming in Multichannel Cognitive Radio Systems

» Pricingbased spectrum access control in cognitive radio networks with random access

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2007
Where	STOC
Authors	Sergiu Hart, Yishay Mansour

Comments (0)