34 search results - page 5 / 7 » Finding Equilibria in Games of No Chance |
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We present a technique for reducing a normal-form (aka. (bi)matrix) game, O, to a smaller normal-form game, R, for the purpose of computing a Nash equilibrium. This is done by com...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
We investigate equilibrium strategies for bidding agents that participate in multiple, simultaneous second-price auctions with perfect substitutes. For this setting, previous rese...
PERCOM
2009
ACM
14 years 8 months ago
2009
ACM
In pervasive computing environments, personal information is expressed in digital forms to a great extent. Daily activities and personal preferences may be easily associated with p...
WAOA
2010
Springer
13 years 5 months ago
2010
Springer
We consider cut games where players want to cut themselves off from different parts of a network. These games arise when players want to secure themselves from areas of potential i...
GLOBECOM
2009
IEEE
13 years 11 months ago
2009
IEEE
We consider a problem where two selfish cognitive radio users try to share two channels on which they each have potentially different valuations. We first formulate the problem as ...