• Corpus ID: 17165875

Decision Maker using Coupled Incompressible-Fluid Cylinders

  title={Decision Maker using Coupled Incompressible-Fluid Cylinders},
  author={Song-Ju Kim and Masashi Aono},
The multi-armed bandit problem (MBP) is the problem of finding, as accurately and quickly as possible, the most profitable option from a set of options that gives stochastic rewards by referring to past experiences. Inspired by fluctuated movements of a rigid body in a tug-of-war game, we formulated a unique search algorithm that we call the `tug-of-war (TOW) dynamics' for solving the MBP efficiently. The cognitive medium access, which refers to multi-user channel allocations in cognitive radio… 

Figures and Tables from this paper

Decision Maker based on Atomic Switches
It is shown that, as long as its total number of metal atoms is conserved when coupled with suitable operations, an atomic switch system provides a sophisticated ``decision-making'' capability that is known to be one of the most important intellectual abilities in human beings.
Harnessing Natural Fluctuations: Analogue Computer for Efficient Socially Maximal Decision Making
A prototype of an analog computer that efficiently solves CBPs by exploiting the physical dynamics of numerous fluids in coupled cylinders is demonstrated, suggesting that to optimise the social rewards, the utilisation of fluid-derived natural fluctuations is more advantageous than applying artificial external fluctuations.
Harnessing the Computational Power of Fluids for Optimization of Collective Decision Making
This work demonstrates an analog computing device that uses numerous fluids in coupled cylinders to efficiently solve CBP for the maximization of social rewards, without paying the conventionally-required huge computational cost.
From AI to Natural Intelligence : Harnessing the Computational Power of Nature
a) E-mail: KIM.Songju@nims.go.jp 赤に変わりそうな状況を考えよう.ここで,先行する 車両が進路に停滞しているにもかかわらず,停止する ことなく直進しようとする車は,目的地により速く到 着したいという個の利益を追求する意思決定をしてい る.この車が交差点の東西方向の中央に停滞するせい で,南北方向の青信号を直進しようとする他の車 (他


Tug-of-War Model for Multi-armed Bandit Problem
A model - the "tug-of-war (TOW) model" - to conduct unique parallel searches using many nonlocally correlated search agents based on a single-celled amoeba, the true slime mold Physarum, which maintains a constant intracellular resource volume while collecting environmental information by concurrently expanding and shrinking its branches.
Efficient decision-making by volume-conserving physical object
Decision-making is one of the most important intellectual abilities of not only humans but also other biological organisms, helping their survival. This ability, however, may not be limited to
Amoeba-inspired algorithm for cognitive medium access
This study proposes two variants of the Tow model (solid type and liquid type) for the CBP and shows that the performance of the solid-type TOW model is better than that of the well-known upper confidence bound 1 (UCB1)-tuned algorithm, particularly for the hard problem instances.
Finite-time Analysis of the Multiarmed Bandit Problem
This work shows that the optimal logarithmic regret is also achievable uniformly over time, with simple and efficient policies, and for all reward distributions with bounded support.
Explore/Exploit Schemes for Web Content Optimization
A Bayesian solution to find the optimal trade-off between explore and exploit for web content publishing applications where dynamic set of items with short lifetimes, delayed feedback and non-stationary reward distributions are typical is developed.
Medium access in cognitive radio networks: A competitive multi-armed bandit framework
  • L. Lai, Hai Jiang, H. Poor
  • Computer Science, Business
    2008 42nd Asilomar Conference on Signals, Systems and Computers
  • 2008
Low complexity medium access protocols are developed which strike an optimal balance between exploration and exploitation in such competitive environments, and the operating points of these low complexity protocols are shown to converge to those of the scenario in which the parameters are known.
Modification of UCT with Patterns in Monte-Carlo Go
A Monte-Carlo Go program, MoGo, which is the first computer Go program using UCT, is developed, and the modification of UCT for Go application is explained and also the intelligent random simulation with patterns which has improved significantly the performance of MoGo.
Selfish routing and the price of anarchy
A survey of recent work that analyzes the price of anarchy of selfish routing, a classical mathematical model of how self-interested users might route traffic through a congested network.