Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ryan Mahtab

dblp:294/1216 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Reinforcement learning · 44% Multi-agent systems · 44% Planning, search and constraint satisfaction · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Multi-agent systems › autonomous agents
game-playing agents
0.512021
Evaluating Gin Rummy Hands Using Opponent Modeling and Myopic Meld Distance · AAAI 2021
Machine learning › Reinforcement learning › multi-agent reinforcement learning
opponent modeling
0.512021
Evaluating Gin Rummy Hands Using Opponent Modeling and Myopic Meld Distance · AAAI 2021
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
game tree search
0.112021
Evaluating Gin Rummy Hands Using Opponent Modeling and Myopic Meld Distance · AAAI 2021

Methods — techniques the papers use, named apart from their topics

opponent modeling · 0.5myopic meld distance · 0.5
YearPublicationVenuePosition
2021 Evaluating Gin Rummy Hands Using Opponent Modeling and Myopic Meld Distance
abstract
Gin Rummy is a popular two-player card game involving choices to draw and discard cards to form sets of matching cards. Unlike other popular games such as Chess, Poker, and Go, there is little formal artificial intelligence research about how to make good decisions when playing Gin Rummy. In this paper, we develop an agent that plays Gin Rummy through a combination of known and expected card values, modeling the opponent to predict their cards of interest, and a conservative approach to assessing when to end the hand. In addition to discussing our observations about Gin Rummy that inspired our agent's design and how the agent works, we evaluate the relative importance of various features employed by our agent by competing agents which implement various subsets of those features.
Phoebe Goldman, Corey R. Knutson, Ryan Mahtab, Jack Maloney, Joseph B. Mueller, Richard G. Freedman
AAAI3