Search Results for author:
Found 5 papers, 0 papers with code
Incentivized Exploration of Non-Stationary Stochastic Bandits
We consider two different non-stationary environments: abruptly-changing and continuously-changing, and propose respective incentivized exploration algorithms.
On simple expectations and observations of intelligent agents: A complexity study
Public observation logic (POL) reasons about agent expectations and agent observations in various real world situations.
On verifying expectations and observations of intelligent agents
Public observation logic (POL) is a variant of dynamic epistemic logic to reason about agent expectations and agent observations.
The Role of Symmetry in Quantum Query-to-Communication Simulation
We show that the O(log n) overhead is required for some functions in the quantum setting, and thus the BCW simulation is tight.
Quantum Physics Computational Complexity
Two new results about quantum exact learning
We present two new results about exact learning by quantum computers.
