S. Uryasev and R. Y. Rubinstein, "On relaxation algorithms in computation of noncooperative equilibria," IEEE Trans. Automat. Contr., vol. 39, pp. 1263--1267, June 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Selfish Routing in Internet-Like Environments - Qiu, Yang, Zhang, Shenker (2003) (16 citations) (Correct)
....OSPF routing is used. Using such logical networks, we can compute the traffic equilibria of overlay routing by either a modified linear approximation algorithm or a relaxation algorithm (see Appendix for details) When there are multiple overlays, we use the relaxation framework proposed in [23, 41] to ensure convergence (see Appendix for details) 4.3 Compliant routing For comparison, we also consider the default network level routing, which we term compliant routing. Compliant routing: Traffic demands using compliant routing follow the routes determined by the network level routing ....
S. Uryas'ev and R. Y. Rubinstein. On relaxation algorithms in computation of noncooperative equilibria. IEEE Transactions on Automatic Control, 39(6):1263--1267, Jun. 1995.
Relaxation Algorithms In Finding Nash Equilibria - Steffan Berridge And (1997) (1 citation) (Correct)
....29 Relaxation Algorithms in finding Nash Equilibria 1. INTRODUCTION Game theory problems are renown for being difficult to solve, especially many player, non zero sum and dynamic games. Computation of Nash equilibria using the Nikaido Isoda function [4] and the relaxation algorithm [2] [8] seems to be an attractive possibility in that the most advanced technique required is minimisation of a multivariate function; a well studied topic. The aim of this paper is to use the relaxation algorithm to find Nash equilibria in games of varying complexity. The motivating paper [8] sets the ....
....[2] 8] seems to be an attractive possibility in that the most advanced technique required is minimisation of a multivariate function; a well studied topic. The aim of this paper is to use the relaxation algorithm to find Nash equilibria in games of varying complexity. The motivating paper [8] sets the foundation for the usage of the relaxation algorithm to find Nash normalised equilibria, and promises its success for a certain class of games. The contribution of the present paper is in applyinging this idea to some specific game theory problems and reporting on equilibrium computation ....
[Article contains additional citation context not shown here]
STANISLAV URYAS'EV &REUVEN Y. RUBINSTEIN, 1994, "On Relaxation Algorithms in Computation of Noncooperative Equilibria", IEEE Transactions on Automatic Control, Vol. 39, No. 6. pp. 1263-1267. 29
Numerical Solutions to Nash-Cournot Equilibria in.. - Contreras, Klusch.. (2004) (Correct)
No context found.
S. Uryasev and R. Y. Rubinstein, "On relaxation algorithms in computation of noncooperative equilibria," IEEE Trans. Automat. Contr., vol. 39, pp. 1263--1267, June 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC