Darryl A Seale
Biographic Data
| ID | 6540310 |
|---|---|
| NAME | Darryl A Seale |
| GIVEN NAMES | Darryl A |
| FAMILY NAME | Seale |
| SIGNATURE | SEALE D A |
| AFFILIATIONS | University of Nevada, Las Vegas |
| ORCID | 0000-0003-0037-7839 |
| VERIFIED | Yes |
| TOTAL WORKS | 5 |
| TOTAL CITATIONS | 0 |
| AUTHOR COUNT | 5 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 2000 |
| LATEST PUBLICATION YEAR | 2025 |
| H-INDEX | 0 |
Motivations, expectations, and hopes of participants and stakeholders in the GROW ‘Hopes for Life' intervention study
Unhealthy alcohol use is the greatest risk factor for premature death and disease among young individuals aged 15-49. Two interventions developed by Global Resilience Oral Workshops (GROW), a faith-based substance use recovery/character training programme, show potential in the reduction of alcohol use through specifically targeted character building. These programmes were rolled out in Lusaka and Sinda districts in Zambia among school and commun…
Progressive stopping heuristics that excel in individual and competitive sequential search
We study the performance of heuristics relative to the performance of optimal solutions in the rich domain of sequential search, where the decision to stop the search depends only on the applicant’s relative rank. Considering multiple variants of the secretary problem, that vary from one another in their formulation and method of solution, we find that descriptive heuristics perform well only when the optimal solution prescribes a single threshol…
Package deals in multi‐issue bilateral bargaining
This manuscript proposes a novel mechanism of multi‐issue bilateral bargaining under incomplete information. A single seller and single buyer negotiate the prices of multiple items by submitting offers and counteroffers in which the items are traded as a package deal. Trade occurs if the sum of the individual profits across all items is non‐negative. We experimentally compare a simultaneous protocol, where the two sets of price offers are submitt…
Bluffing and betting behavior in a simplified poker game
A pure‐strategy, simplified poker (PSP) game is proposed, where two players draw from a small and discrete number of hands. Equilibrium strategies of the game are described and an experiment is conducted where 120 subjects played the PSP against a computer, which was programmed to play either the equilibrium solution or a fictitious play (FP) learning algorithm designed to take advantage of poor play. The results show that players did not adopt t…
Optimal stopping behavior with relative ranks: The secretary problem with unknown population size
We examine multi-period observation and selection problems with an unknown number of applicants in which applicants are interviewed one at a time on each period, recall of applicants that were interviewed and rejected is not possible, the decision on each period to reject or accept an applicant is based on relative ranks, and the objective is to maximize the probability of accepting the top-ranked applicant. We propose and then assess the efficie…
No prominent works on this page.
Optimal stopping behavior with relative ranks: The secretary problem with unknown population size
We examine multi-period observation and selection problems with an unknown number of applicants in which applicants are interviewed one at a time on each period, recall of applicants that were interviewed and rejected is not possible, the decision on each period to reject or accept an applicant is based on relative ranks, and the objective is to maximize the probability of accepting the top-ranked applicant. We propose and then assess the efficie…
Bluffing and betting behavior in a simplified poker game
A pure‐strategy, simplified poker (PSP) game is proposed, where two players draw from a small and discrete number of hands. Equilibrium strategies of the game are described and an experiment is conducted where 120 subjects played the PSP against a computer, which was programmed to play either the equilibrium solution or a fictitious play (FP) learning algorithm designed to take advantage of poor play. The results show that players did not adopt t…
Package deals in multi‐issue bilateral bargaining
This manuscript proposes a novel mechanism of multi‐issue bilateral bargaining under incomplete information. A single seller and single buyer negotiate the prices of multiple items by submitting offers and counteroffers in which the items are traded as a package deal. Trade occurs if the sum of the individual profits across all items is non‐negative. We experimentally compare a simultaneous protocol, where the two sets of price offers are submitt…
Progressive stopping heuristics that excel in individual and competitive sequential search
We study the performance of heuristics relative to the performance of optimal solutions in the rich domain of sequential search, where the decision to stop the search depends only on the applicant’s relative rank. Considering multiple variants of the secretary problem, that vary from one another in their formulation and method of solution, we find that descriptive heuristics perform well only when the optimal solution prescribes a single threshol…
Motivations, expectations, and hopes of participants and stakeholders in the GROW ‘Hopes for Life' intervention study
Unhealthy alcohol use is the greatest risk factor for premature death and disease among young individuals aged 15-49. Two interventions developed by Global Resilience Oral Workshops (GROW), a faith-based substance use recovery/character training programme, show potential in the reduction of alcohol use through specifically targeted character building. These programmes were rolled out in Lusaka and Sinda districts in Zambia among school and commun…
Computer Science (4 works) · Economics (4 works) · Auction Theory and Applications (3 works) · Psychology (3 works) · Advanced Bandit Algorithms Research (2 works) · Artificial Intelligence (2 works) · Econometrics (2 works) · Experimental Behavioral Economics Studies (2 works) · Game Theory and Applications (2 works) · Mathematics (2 works)