Sciweavers

156 search results - page 7 / 32
» Homotopy Methods to Compute Equilibria in Game Theory
Sort
View
75
Voted
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
14 years 11 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
102
Voted
MOBIHOC
2012
ACM
13 years 2 days ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang
AAAI
2012
13 years 11 hour ago
Computing Optimal Strategies to Commit to in Stochastic Games
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...
Joshua Letchford, Liam MacDermed, Vincent Conitzer...
UAI
2004
14 years 11 months ago
Computing Nash Equilibria of Action-Graph Games
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
Navin A. R. Bhat, Kevin Leyton-Brown
SAGT
2009
Springer
163views Game Theory» more  SAGT 2009»
15 years 4 months ago
Nash Equilibria and the Price of Anarchy for Flows over Time
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
Ronald Koch, Martin Skutella