How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...
A negotiation chain is formed when multiple related negotiations are spread over multiple agents. In order to appropriately order and structure the negotiations occurring in the c...
In our prior work, we introduced a generalization of the multiple-instance learning (MIL) model in which a bag's label is not based on a single instance's proximity to a...
A major difficulty in building Bayesian network models is the size of conditional probability tables, which grow exponentially in the number of parents. One way of dealing with th...
Hierarchical state decompositions address the curse-ofdimensionality in Q-learning methods for reinforcement learning (RL) but can suffer from suboptimality. In addressing this, w...
Erik G. Schultink, Ruggiero Cavallo, David C. Park...