Related papers: One-Switch Discount Functions
Motivated by recent work on scheduling with predicted job sizes, we consider the performance of scheduling algorithms with minimal advice, namely a single bit. Besides demonstrating the power of very limited advice, such schemes are quite…
This paper studies properties of functions having monotone tails. We extend Theorem 1 of Dhaene et al. (2002a) and show how the tail quantiles of a random variable transformed with a monotone tail function can be expressed as the…
A method is given for quantitatively rating the social acceptance of different options which are the matter of a complete preferential vote. Completeness means that every voter expresses a comparison (a preference or a tie) about each pair…
We demonstrate a limitation of discounted expected utility, a standard approach for representing the preference to risk when future cost is discounted. Specifically, we provide an example of the preference of a decision maker that appears…
We use decision theory to compare variants of differential privacy from the perspective of prospective study participants. We posit the existence of a preference ordering on the set of potential consequences that study participants can…
This paper introduces the \emph{serial-parallel decision problem}. Consider an online scheduler that receives a series of tasks, where each task has both a parallel and a serial implementation. The parallel implementation has the advantage…
We formulate a coherent approach to signals and systems theory on time scales. The two derivatives from the time-scale calculus are used, i.e., nabla (forward) and delta (backward), and the corresponding eigenfunctions, the so-called nabla…
We consider black-box global optimization of time-consuming-to-evaluate functions on behalf of a decision-maker (DM) whose preferences must be learned. Each feasible design is associated with a time-consuming-to-evaluate vector of…
We consider randomized mechanisms with optional participation. Preferences over lotteries are modeled using skew-symmetric bilinear (SSB) utility functions, a generalization of classic von Neumann-Morgenstern utility functions. We show that…
In recent years, there is growing need and interest in formalizing and reasoning about the quality of software and hardware systems. As opposed to traditional verification, where one handles the question of whether a system satisfies, or…
A novel switching differentiator that has considerably simple form is proposed. Under the assumption that time-derivatives of the signal are norm-bounded, it is shown that estimation errors are convergent to the zeros asymptotically. The…
This paper considers the distributed smooth optimization problem in which the objective is to minimize a global cost function formed by a sum of local smooth cost functions, by using local information exchange. The standard assumption for…
We study best-of-both-worlds guarantees for the fair division of indivisible items among agents with subadditive valuations. Our main result establishes the existence of a random allocation that is simultaneously ex-ante…
Poisson processes and one-dimensional Poisson point processes satisfy three main properties: superposition, thinning, and conditioning. The proof of the first two relies on basic estimates involving the Poisson distribution that are also…
Discounted reinforcement learning is usually presented through Bellman equations on closed Markov decision processes. This paper develops a compositional view: a one-step decision process is treated as an open stochastic component, and…
We characterize those ex-ante restrictions on the random utility model which lead to identification. We first identify a simple class of perturbations which transfer mass from a suitable pair of preferences to the pair formed by swapping…
Offline reinforcement learning refers to the process of learning policies from fixed datasets, without requiring additional environment interaction. However, it often relies on well-defined reward functions, which are difficult and…
Recently, a new concept called multiplicative differential was introduced by Ellingsen et al. Inspired by this pioneering work, power functions with low c-differential uniformity were constructed. Wang et al. defined the c-differential…
Two networks of queues models, presented initially by Jackson, in the open case, and Gordon and Newell, in the closed case, stochastic processes are presented and studied in some of their details and problems. The service times are…
To choose between two discrete goods, a consumer pays attention to only those with prices below a threshold. From these, she chooses her most preferred good. We assume consumers in a population have the same preference but may have…