Related papers: A new bound of concurrence
We study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not included in the class of monotone Boolean functions. For the…
Recent research in industrial organisation has investigated the essential place that middlemen have in the networks that make up our global economy. In this paper we attempt to understand how such middlemen compete with each other through a…
We introduce a new criterion which if satisfied implies the Riemann hypothesis.
We prove a central limit theorem with aassumptions which are many weak than classical conditions
We make two tiny corrections to our previous paper with the same title, and also obtain, as a bonus, something new.
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input, we use a quantum adversary that runs the algorithm with a…
A canonical setting for non-monetary online resource allocation is one where agents compete over multiple rounds for a single item per round, with i.i.d. valuations and additive utilities across rounds. With $n$ symmetric agents, a natural…
New cases of the multiplicity conjecture are considered.
We propose a new PAC-Bayesian bound and a way of constructing a hypothesis space, so that the bound is convex in the posterior distribution and also convex in a trade-off parameter between empirical performance of the posterior distribution…
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progress function caused by one query. All previous variants…
We prove a variation of Gronwall's lemma.
We provide new sufficient conditions under which Ryser's conjecture holds.
I propose a notion of $(\omega_1,\beta)$-morass for the case $\omega_1 \leq \beta$.
In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for real time application. Our proposal oppose the allocation of…
In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for real time application. Our proposal oppose the allocation of…
We study liquidity provision in the presence of exogenous competition. We consider a `reference market maker' who monitors her inventory and the aggregated inventory of the competing market makers. We assume that the competing market makers…
We build upon recent work [Kleinberg and Oren, 2014, Kleinberg et al., 2016, 2017] that considers present biased agents, who place more weight on costs they must incur now than costs they will incur in the future. They consider a graph…
We present an extension of Eigen's model for quasi-species including the competition among individuals, proposed as the simplest mechanism for the formation of new species in a smooth fitness landscape. We are able to obtain analytically…
We study the regulation of a monopolistic firm using a robust-design approach. We solve for the policy that minimizes the regulator's worst-case regret, where the regret is the difference between his complete-information payoff minus his…
Algorithmic decision making systems are ubiquitous across a wide variety of online as well as offline services. These systems rely on complex learning methods and vast amounts of data to optimize the service functionality, satisfaction of…