3 citations · 3 across the 3 of their papers we have counts for
4 papers
Explicit Explore, Exploit, or Escape (): near-optimal safety-constrained reinforcement learning in polynomial time
David M. Bossens, Nicholas Bishop
In reinforcement learning (RL), an agent must explore an initially unknown environment in order to learn a desired behaviour. When RL agents are deployed in real world environments…
Playing Coopetitive Polymatrix Games with Small Manipulation Cost
Shivakumar Mahesh, Nicholas Bishop, Le Cong Dinh +1
Iterated coopetitive games capture the situation when one must efficiently balance between cooperation and competition with the other agents over time in order to win the game (e.g…
Sequential Blocked Matching
Nicholas Bishop, Hau Chan, Debmalya Mandal +1
We consider a sequential blocked matching (SBM) model where strategic agents repeatedly report ordinal preferences over a set of services to a central planner. The planner's goal i…
Exploiting No-Regret Algorithms in System Design
Le Cong Dinh, Nick Bishop, Long Tran-Thanh
We investigate a repeated two-player zero-sum game setting where the column player is also a designer of the system, and has full control on the design of the payoff matrix. In add…