Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2019

2019

We present a brief outline of an approximate method (3LP) proposed by E.G. Golshteyn for solving three-person games in mixed… Expand

Is this relevant?

2017

2017

The complexity class CLS was introduced by Daskalakis and Papadimitriou with the goal of capturing the complexity of some well… Expand

Is this relevant?

2011

2011

We show that the widely used homotopy method for solving fix point problems, as well as the Harsanyi-Selten equilibrium selection… Expand

Is this relevant?

2010

2010

This paper proposes a NASH Q-learning (NashQ) algorithm in a packet forwarding game in overlay noncooperative multi-agent… Expand

Is this relevant?

2008

2008

We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used… Expand

Is this relevant?

2006

2006

In this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

In this study, we seek a better understanding of how individuals and their daily interactions shape and reshape social structures… Expand

Is this relevant?

2003

2003

The Lemke-Howson algorithm is the classical algorithm for find- ing one equilibrium of a bimatrix game. In this paper we present… Expand

Is this relevant?

2000

2000

The differential LEMKE PROBE LDP-5 can be used for an quick scan of the partial discharge (PD) level of the different high… Expand

Is this relevant?

1991

1991

The modified Lemke-Howson algorithm is a constructive procedure which enables us to compute equilibrium points of a bimatrix game… Expand

Is this relevant?