Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Gandhi, Ratnik"'
Autor:
Patel, Shreyas, Kakadiya, Ashutosh, Mehta, Maitrey, Derasari, Raj, Patel, Rahul, Gandhi, Ratnik
Generative Adversarial Networks (GAN) have shown great promise in tasks like synthetic image generation, image inpainting, style transfer, and anomaly detection. However, generating discrete data is a challenge. This work presents an adversarial trai
Externí odkaz:
http://arxiv.org/abs/1804.00925
Autor:
Gandhi, Ratnik, Rajgor, Amoli
An efficient Singular Value Decomposition (SVD) algorithm is an important tool for distributed and streaming computation in big data problems. It is observed that update of singular vectors of a rank-1 perturbed matrix is similar to a Cauchy matrix-v
Externí odkaz:
http://arxiv.org/abs/1707.08369
Publikováno v:
In Procedia Computer Science 2020 171:999-1008
Autor:
Chatterji, Samaresh, Gandhi, Ratnik
A Nash equilibrium has become important solution concept for analyzing the decision making in Game theory. In this paper, we consider the problem of computing Nash equilibria of a subclass of generic finite normal form games. We define "rational payo
Externí odkaz:
http://arxiv.org/abs/1005.5507
Autor:
Chatterji, Samaresh, Gandhi, Ratnik
We study the problem of computing all Nash equilibria of a subclass of finite normal form games. With algebraic characterization of the games, we present a method for computing all its Nash equilibria. Further, we present a method for deciding member
Externí odkaz:
http://arxiv.org/abs/1001.4887
Autor:
Gandhi, Ratnik
Publikováno v:
IndraStra Global.
In this work we consider methods for computing Nash equilibria of finite normal form games that emphasize use of polynomial algebra. Nash equilibria of a game can be characterized as solutions to a system of polynomial equations that we call the game
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Gandhi, Ratnik
Publikováno v:
IndraStra Global.
This work studies the two important problems of routing and network creation in the situation of selfish behavior of agents. In routing, agents want to send their data from source to destination. They try to reduce cost incurred in the process of rou
Autor:
Chatterji, Samaresh, Gandhi, Ratnik
Publikováno v:
ACM Communications in Computer Algebra; July 2011, Vol. 45 Issue: 2 p115-116, 2p