Indian Statistical Institute

Playing with tokens (potentially infinite vertex capacity--Theoretical)

In this paper, a basic token sliding puzzle in graphs (with infinite vertex capacities) has been studied. The rule is in each step (or time epoch) we are moving k tokens simultaneously, where k may be fixed or may be varied over a given set T. The reachability characterisations i...

Playing with tokens (potentially infinite vertex capacity--Theoretical)

In this paper, a basic token sliding puzzle in graphs (with infinite vertex capacities) has been studied. The rule is in each step (or time epoch) we are moving k tokens simultaneously, where k may be fixed or may be varied over a given set T. The reachability characterisations i...

Two-person zero-sum games without expected utility preferences: a proposal

A solution concept for two-person zero-sum games is proposed with only the Independence axiom assumed of players' preferences. We do not assume Continuity which is critical for many fixed-point theorems. Each player is shown to admit a set of "admissible" strategies assuring mini...

A Review on Janus Nanoparticles: Duality Leading to Prospective Multipotent Applications

Janus nanoparticles (JNPs), named after the bi-faced Roman God has emerged as a hot topic in the present era of nanoscience because of their chemical, structural and physical uniqueness. These particles stand out in the crowd as they are composed of two or more faces with contras...

Learning models on rooted regular trees with majority update policy: Convergence and phase transition

Abstract We study a model of social learning on rooted regular trees. An agent is stationed at each vertex of double struck upper T Subscript m <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.ca...