Zobrazeno 1 - 10
of 474
pro vyhledávání: '"Subramanian, P G"'
Autor:
Tang, Dengwang, Subramanian, Vijay G.
We consider a two-player dynamic information design problem between a principal and a receiver -- a game is played between the two agents on top of a Markovian system controlled by the receiver's actions, where the principal obtains and strategically
Externí odkaz:
http://arxiv.org/abs/2403.12204
We consider a long-term average profit maximizing admission control problem in an M/M/1 queuing system with unknown service and arrival rates. With a fixed reward collected upon service completion and a cost per unit of time enforced on customers wai
Externí odkaz:
http://arxiv.org/abs/2212.11316
Autor:
Su, Shih-Tang, Subramanian, Vijay G.
The commitment power of senders distinguishes Bayesian persuasion problems from other games with (strategic) communication. Persuasion games with multiple senders have largely studied simultaneous commitment and signalling settings. However, many rea
Externí odkaz:
http://arxiv.org/abs/2202.06479
We study a Bayesian persuasion setting in which the receiver is trying to match the (binary) state of the world. The sender's utility is partially aligned with the receiver's, in that conditioned on the receiver's action, the sender derives higher ut
Externí odkaz:
http://arxiv.org/abs/2110.10909
We consider a Bayesian persuasion or information design problem where the sender tries to persuade the receiver to take a particular action via a sequence of signals. This we model by considering multi-phase trials with different experiments conducte
Externí odkaz:
http://arxiv.org/abs/2110.09594
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Tang, Dengwang, Subramanian, Vijay G.
In a computing center with a huge amount of machines, when a job arrives, a dispatcher need to decide which machine to route this job to based on limited information. A classical method, called the power-of-$d$ choices algorithm is to pick $d$ server
Externí odkaz:
http://arxiv.org/abs/1901.09094
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Tang, Dengwang, Subramanian, Vijay G.
In the standard ball-in-bins experiment, a well-known scheme is to sample $d$ bins independently and uniformly at random and put the ball into the least loaded bin. It can be shown that this scheme yields a maximum load of $\log\log n/\log d+O(1)$ wi
Externí odkaz:
http://arxiv.org/abs/1810.02722