Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Decision Making: Traditional Method
Observational Learning
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
Statically Indeterminate Problem Solving
Associative Learning
You might also read
Articles linked to this work by shared authors, journal, and citation graph.
Updated: May 29, 2026

The HoneyComb Paradigm for Research on Collective Human Behavior
Published on: January 19, 2019
Omkar Tilak1, Ryan Martin, Snehasis Mukhopadhyay
1Department of Computer and Information Science, Indiana University-Purdue University Indianapolis, Indianapolis, IN 46202, USA. otilak@cs.iupui.edu
This study introduces a novel decentralized pursuit learning algorithm for zero-sum and identical payoff games, offering computational advantages. The algorithm
Area of Science:
Background:
Purpose of the Study:
Main Methods:
Main Results:
Conclusions: