TWO AGENTS FOR ANAESTHESIA INDUCTION

InPharma ◽  
1976 ◽  
Vol 53 (1) ◽  
pp. 9-9
Keyword(s):  
Anaesthesia Induction ◽  
Two Agents

scholarly journals Truthful fair division without free disposal

2020 ◽  
Vol 55 (3) ◽  
pp. 523-545 ◽  
Author(s):  
Xiaohui Bei ◽  
Guangda Huzhang ◽  
Warut Suksompong
Keyword(s):  
Fair Division ◽  
Multiple Agents ◽  
Two Agents ◽  
Free Disposal ◽  
Cake Cutting ◽  
Strategic Agents ◽  
Additional Constraints

Abstract We study the problem of fairly dividing a heterogeneous resource, commonly known as cake cutting and chore division, in the presence of strategic agents. While a number of results in this setting have been established in previous works, they rely crucially on the free disposal assumption, meaning that the mechanism is allowed to throw away part of the resource at no cost. In the present work, we remove this assumption and focus on mechanisms that always allocate the entire resource. We exhibit a truthful and envy-free mechanism for cake cutting and chore division for two agents with piecewise uniform valuations, and we complement our result by showing that such a mechanism does not exist when certain additional constraints are imposed on the mechanisms. Moreover, we provide bounds on the efficiency of mechanisms satisfying various properties, and give truthful mechanisms for multiple agents with restricted classes of valuations.

Rationality and Strongly Polynomial Solvability of Eisenberg–Gale Markets with Two Agents

2010 ◽  
Vol 24 (3) ◽  
pp. 1117-1136 ◽  
Author(s):  
Deeparnab Chakrabarty ◽  
Nikhil R. Devanur ◽  
Vijay V. Vazirani
Keyword(s):  
Polynomial Solvability ◽  
Two Agents ◽  
Strongly Polynomial

scholarly journals Development of a Two-Step Route to 3-PBC and βCCt, Two Agents Active against Alcohol Self-Administration in Rodent and Primate Models

2011 ◽  
Vol 76 (11) ◽  
pp. 4721-4727 ◽  
Author(s):  
Ojas A. Namjoshi ◽  
Angelica Gryboski ◽  
German O. Fonseca ◽  
Michael L. Van Linn ◽  
Zhi-jian Wang ◽  
...  
Keyword(s):  
Self Administration ◽  
Two Agents

A Comparison of Transmitter and Synephrine on Luminescence Induction in the Firefly Larva

1972 ◽  
Vol 57 (3) ◽  
pp. 737-743
Author(s):  
ALBERT D. CARLSON
Keyword(s):  
Monoamine Oxidase ◽  
Extinction Rate ◽  
Pharmacological Effects ◽  
Response Latencies ◽  
Atp Production ◽  
Two Agents ◽  
Oxidase Enzyme ◽  
The Difference

1. The pharmacological effects of neural transmitter and synephrine are compared with respect to induction of luminescence in extirpated larval firefly lanterns. 2. Transmitter and synephrine show many similarities of action. They are as follows: (a) They both act directly on the lantern. (b) Their response latencies are relatively constant. (c) Both stimulate ATP production. (d) Neither induces a persistent intermediate in anoxic lanterns. (e) No monoamine oxidase enzyme appears to act on them. (f) The luminescence-inducing action of both is rapidly blocked by chlorpromazine. (g) They show identical responses in the presence of dichloroisoproterenol. 3. Luminescence induced by transmitter is much more rapidly extinguished than that induced by syneprine. 4. The possible reasons for the difference in luminescence extinction rate between the two agents are discussed and their different modes of delivery are emphasized.

scholarly journals ON THE CONSENSUS THRESHOLD FOR THE OPINION DYNAMICS OF KRAUSE–HEGSELMANN

2005 ◽  
Vol 16 (02) ◽  
pp. 259-270 ◽  
Author(s):  
SANTO FORTUNATO
Keyword(s):  
Social Relationships ◽  
Complete Graph ◽  
Opinion Dynamics ◽  
Consensus Model ◽  
Confidence Bound ◽  
Real Numbers ◽  
Numerical Evidence ◽  
Two Agents ◽  
The Social ◽  
The Difference

In the consensus model of Krause–Hegselmann, opinions are real numbers between 0 and 1, and two agents are compatible if the difference of their opinions is smaller than the confidence bound parameter ∊. A randomly chosen agent takes the average of the opinions of all neighboring agents which are compatible with it. We propose a conjecture, based on numerical evidence, on the value of the consensus threshold ∊c of this model. We claim that ∊c can take only two possible values, depending on the behavior of the average degree d of the graph representing the social relationships, when the population N approaches infinity: if d diverges when N→∞, ∊c equals the consensus threshold ∊i~0.2 on the complete graph; if instead d stays finite when N→∞, ∊c =1/2 as for the model of Deffuant et al.

scholarly journals Two is better than one: Social rewards from two agents enhance offline improvements in motor skills more than single agent

PLoS ONE ◽  
2020 ◽  
Vol 15 (11) ◽  
pp. e0240622
Author(s):  
Masahiro Shiomi ◽  
Soto Okumura ◽  
Mitsuhiko Kimoto ◽  
Takamasa Iio ◽  
Katsunori Shimohara
Keyword(s):  
Motor Skills ◽  
Single Agent ◽  
Two Agents ◽  
Social Rewards ◽  
Better Than
Sign in / Sign up

Export Citation Format

Share Document