Decision-Making in the Primate Brain

Making decisions is fundamental to everything we do, yet it can be impaired in various disorders and conditions. While research into the neural basis of decision-making has flourished in recent years, many questions remain about how decisions are instantiated in the brain. Here we explored how primates make abstract decisions and decisions in social contexts, as well as one way to non-invasively modulate the brain circuits underlying decision-making. We used rhesus macaques as our model organism. First we probed numerical decision-making, a form of abstract decision-making. We demonstrated that monkeys are able to compare discrete ratios, choosing an array with a greater ratio of positive to negative stimuli, even when this array does not have a greater absolute number of positive stimuli. Monkeys’ performance in this task adhered to Weber’s law, indicating that monkeys—like humans—treat proportions as analog magnitudes. Next we showed that monkeys’ ordinal decisions are influenced by spatial associations; when trained to select the fourth stimulus from the bottom in a vertical array, they subsequently selected the fourth stimulus from the left—and not from the right—in a horizontal array. In other words, they begin enumerating from one side of space and not the other, mirroring the human tendency to associate numbers with space. These and other studies confirmed that monkeys’ numerical decision-making follows similar patterns to that of humans, making them a good model for investigations of the neurobiological basis of numerical decision-making.

We sought to develop a system for exploring the neuronal basis of the cognitive and behavioral effects observed following transcranial magnetic stimulation, a relatively new, non-invasive method of brain stimulation that may be used to treat clinical disorders. We completed a set of pilot studies applying offline low-frequency repetitive transcranial magnetic stimulation to the macaque posterior parietal cortex, which has been implicated in numerical processing, while subjects performed a numerical comparison and control color comparison task, and while electrophysiological activity was recorded from the stimulated region of cortex. We found tentative evidence in one paradigm that stimulation did selectively impair performance in the number task, causally implicating the posterior parietal cortex in numerical decisions. In another paradigm, however, we manipulated the subject’s reaching behavior but not her number or color comparison performance. We also found that stimulation produced variable changes in neuronal firing and local field potentials. Together these findings lay the groundwork for detailed investigations into how different parameters of transcranial magnetic stimulation can interact with cortical architecture to produce various cognitive and behavioral changes.

Finally, we explored how monkeys decide how to behave in competitive social interactions. In a zero-sum computer game in which two monkeys played as a shooter or a goalie during a hockey-like “penalty shot” scenario, we found that shooters developed complex movement trajectories so as to conceal their intentions from the goalies. Additionally, we found that neurons in the dorsolateral and dorsomedial prefrontal cortex played a role in generating this “deceptive” behavior. We conclude that these regions of prefrontal cortex form part of a circuit that guides decisions to make an individual less predictable to an opponent.

Game-Theoretically Allocating Resources to Catch Evaders and Payments to Stabilize Teams

Allocating resources optimally is a nontrivial task, especially when multiple

self-interested agents with conflicting goals are involved. This dissertation

uses techniques from game theory to study two classes of such problems:

allocating resources to catch agents that attempt to evade them, and allocating

payments to agents in a team in order to stabilize it. Besides discussing what

allocations are optimal from various game-theoretic perspectives, we also study

how to efficiently compute them, and if no such algorithms are found, what

computational hardness results can be proved.

The first class of problems is inspired by real-world applications such as the

TOEFL iBT test, course final exams, driver's license tests, and airport security

patrols. We call them test games and security games. This dissertation first

studies test games separately, and then proposes a framework of Catcher-Evader

games (CE games) that generalizes both test games and security games. We show

that the optimal test strategy can be efficiently computed for scored test

games, but it is hard to compute for many binary test games. Optimal Stackelberg

strategies are hard to compute for CE games, but we give an empirically

efficient algorithm for computing their Nash equilibria. We also prove that the

Nash equilibria of a CE game are interchangeable.

The second class of problems involves how to split a reward that is collectively

obtained by a team. For example, how should a startup distribute its shares, and

what salary should an enterprise pay to its employees. Several stability-based

solution concepts in cooperative game theory, such as the core, the least core,

and the nucleolus, are well suited to this purpose when the goal is to avoid

coalitions of agents breaking off. We show that some of these solution concepts

can be justified as the most stable payments under noise. Moreover, by adjusting

the noise models (to be arguably more realistic), we obtain new solution

concepts including the partial nucleolus, the multiplicative least core, and the

multiplicative nucleolus. We then study the computational complexity of those

solution concepts under the constraint of superadditivity. Our result is based

on what we call Small-Issues-Large-Team games and it applies to popular

representation schemes such as MC-nets.

Programming Molecular Devices using Nucleic Acid Hairpins

Nucleic Acid hairpins have been a subject of study for the last four decades. They are composed of single strand that is

hybridized to itself, and the central section forming an unhybridized loop. In nature, they stabilize single stranded RNA, serve as nucleation

sites for RNA folding, protein recognition signals, mRNA localization and regulation of mRNA degradation. On the other hand,

DNA hairpins in biological contexts have been studied with respect to forming cruciform structures that can regulate gene expression.

The use of DNA hairpins as fuel for synthetic molecular devices, including locomotion, was proposed and experimental demonstrated in 2003. They

were interesting because they bring to the table an on-demand energy/information supply mechanism.

The energy/information is hidden (from hybridization) in the hairpin’s loop, until required.

The energy/information is harnessed by opening the stem region, and exposing the single stranded loop section.

The loop region is now free for possible hybridization and help move the system into a thermodynamically favourable state.

The hidden energy and information coupled with

programmability provides another functionality, of selectively choosing what reactions to hide and

what reactions to allow to proceed, that helps develop a topological sequence of events.

Hairpins have been utilized as a source of fuel for many different DNA devices. In this thesis, we program four different

molecular devices using DNA hairpins, and experimentally validate them in the

laboratory. 1) The first device: A

novel enzyme-free autocatalytic self-replicating system composed entirely of DNA that operates isothermally. 2) The second

device: Time-Responsive Circuits using DNA have two properties: a) asynchronous: the final output is always correct

regardless of differences in the arrival time of different inputs.

b) renewable circuits which can be used multiple times without major degradation of the gate motifs

(so if the inputs change over time, the DNA-based circuit can re-compute the output correctly based on the new inputs).

3) The third device: Activatable tiles are a theoretical extension to the Tile assembly model that enhances

its robustness by protecting the sticky sides of tiles until a tile is partially incorporated into a growing assembly.

4) The fourth device: Controlled Amplification of DNA catalytic system: a device such that the amplification

of the system does not run uncontrollably until the system runs out of fuel, but instead achieves a finite

amount of gain.

Nucleic acid circuits with the ability

to perform complex logic operations have many potential practical applications, for example the ability to achieve point of care diagnostics.

We discuss the designs of our DNA Hairpin molecular devices, the results we have obtained, and the challenges we have overcome

to make these truly functional.