Sciweavers

83 search results - page 13 / 17
» A Continuation Method for Nash Equilibria in Structured Game...
Sort
View
INFORMATICALT
2002
150views more  INFORMATICALT 2002»
14 years 9 months ago
Search for Dynamic Equilibrium in Duel Problems by Global Optimization
Two examples of open-loop differential games are considered in the paper. Starting with simplified dynamic Duel, further it was developed to differential economic Duel modelling pr...
Raimundas Matulevicius
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
15 years 3 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
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
14 years 8 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
15 years 10 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
WINE
2007
Springer
191views Economy» more  WINE 2007»
15 years 3 months ago
The Importance of Network Topology in Local Contribution Games
We consider a model of content contribution in peer-to-peer networks with linear quadratic payoffs and very general interaction patterns. We find that Nash equilibria of this gam...
Jacomo Corbo, Antoni Calvó-Armengol, David ...