activity
19982022
most citedThe Computational Complexity of Dominance and Consistency in CP-Nets

141 citations · 265 across the 14 of their papers we have counts for

collaborators

17 papers

cs.LG2022

Using Non-Stationary Bandits for Learning in Repeated Cournot Games with Non-Stationary Demand

Kshitija Taywade, Brent Harrison, Judy Goldsmith

Many past attempts at modeling repeated Cournot games assume that demand is stationary. This does not align with real-world scenarios in which market demands can evolve over a prod…

cs.GT2022

Modelling Cournot Games as Multi-agent Multi-armed Bandits

Kshitija Taywade, Brent Harrison, Adib Bagh

We investigate the use of a multi-agent multi-armed bandit (MA-MAB) setting for modeling repeated Cournot oligopoly games, where the firms acting as agents choose from the set of a…

cs.SI2020

Opinion Diffusion Software with Strategic Opinion Revelation and Unfriending

Patrick Shepherd, Mia Weaver, Judy Goldsmith

We present a novel software suite for social network modeling and opinion diffusion processes. Much research on social network science has assumed networks with static topologies.…

cs.CY2020

Regulating Artificial Intelligence: Proposal for a Global Solution

Olivia J. Erdélyi, Judy Goldsmith

With increasing ubiquity of artificial intelligence (AI) in modern societies, individual countries and the international community are working hard to create an innovation-friendly…

cs.LG2020

Multi-agent Reinforcement Learning for Decentralized Stable Matching

Kshitija Taywade, Judy Goldsmith, Brent Harrison

In the real world, people/entities usually find matches independently and autonomously, such as finding jobs, partners, roommates, etc. It is possible that this search for matches…

cs.AI2017★ 1 cited

The Complexity of Campaigning

Cory Siler, Luke Harold Miles, Judy Goldsmith

In "The Logic of Campaigning", Dean and Parikh consider a candidate making campaign statements to appeal to the voters. They model these statements as Boolean formulas over variabl…