Search Results for author:
Found 8 papers, 0 papers with code
The Quantum Advantage in Binary Teams and the Coordination Dilemma: Part II
We identified a decision-theoretic property of the cost called the `coordination dilemma' as a necessary condition for the quantum advantage to manifest.
The Quantum Advantage in Binary Teams and the Coordination Dilemma: Part I
We have shown that entanglement assisted stochastic strategies allow access to strategic measures beyond the classically correlated measures accessible through passive common randomness, and thus attain a quantum advantage in decentralised control.
Signalling for Electricity Demand Response: When is Truth Telling Optimal?
Utilities and transmission system operators (TSO) around the world implement demand response programs for reducing electricity consumption by sending information on the state of balance between supply demand to end-use consumers.
The Quantum Advantage in Decentralized Control
It is known in the context of decentralised control that there exist control strategies consistent with the requirements of a given information structure, yet physically unimplementable through any amount of passive common randomness.
A Scalable Bayesian Persuasion Framework for Epidemic Containment on Heterogeneous Networks
Since the network dependent term in this decomposition is unaffected by the signals sent by the government, this characterization simplifies the problem of finding the optimal information disclosure policies.
Optimal Questionnaires for Screening of Strategic Agents
During the COVID-$19$ pandemic the health authorities at airports and train stations try to screen and identify the travellers possibly exposed to the virus.
Dimensionality Reduction of Affine Variational Inequalities Using Random Projections
The lower-dimensional AVI is obtained by appropriately projecting the original AVI on a randomly chosen subspace.
Approximate dynamic programming using fluid and diffusion approximations with applications to power management
Neuro-dynamic programming is a class of powerful techniques for approximating the solution to dynamic programming equations.
