Abstract—This paper focuses on designing a distributed medium access control algorithm that aims at achieving time fairness among contending stations and throughput maximization ...
Yuan Le, Liran Ma, Wei Cheng, Xiuzhen Cheng, Biao ...
If you were told that some object A was perfectly (or somewhat, or not at all) in some direction (e.g., west, above-right) of some reference object B, where in space would you loo...
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov...
We consider a setting in which a principal seeks to induce an adaptive agent to select a target action by providing incentives on one or more actions. The agent maintains a belief...
Yiling Chen, Jerry Kung, David C. Parkes, Ariel D....
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
Daniel S. Heller, Aurojit Panda, Meinolf Sellmann,...