Sobiad Atıf Dizini

User Guide

Why can I only view 3 results?

You can also view all results when you are connected from the network of member institutions only. For non-member institutions, we are opening a 1-month free trial version if institution officials apply.

So many results that aren't mine?

References in many bibliographies are sometimes referred to as "Surname, I", so the citations of academics whose Surname and initials are the same may occasionally interfere. This problem is often the case with citation indexes all over the world.

How can I see only citations to my article?

After searching the name of your article, you can see the references to the article you selected as soon as you click on the details section.

Downloands 2

Article Detail

Mendeley

Endnote

Algorithms for finding optimal paths in network games with p players

1997

Journal:

Computer Science Journal of Moldova

Author:

Abstract:

We study the problem of finding optimal paths in network games with p players. Some polynomial-time algorithms for finding optimal paths and optimal by Nash strategies of the players in network games with p players are proposed.

Keywords:

Citation Owners

Information: There is no ciation to this publication.

Metrics

Article : 627

Cite : 3.639

Details

Abstract
Listen the Abstract

Author : --

Journal :

Issue

Year

Type

Citation Count

View PDF

Relevant Articles
Article Who Cited This Publication

Relevant Articles	Author	#

Article	Author	#

User Guide

Menu

Mendeley

Endnote

Algorithms for finding optimal paths in network games with p players

1997

Journal:

Computer Science Journal of Moldova

Author:

Abstract:

Keywords:

Citation Owners

Information: There is no ciation to this publication.

Similar Articles

Computer Science Journal of Moldova

Metrics