-
作者：Disser, Yann; Fearnley, John; Gairing, Martin; Goebel, Oliver; Klimm, Max; Schmand, Daniel; Skopalik, Alexander; Toennis, Andreas
作者单位：Technical University of Darmstadt; University of Liverpool; RWTH Aachen University; Humboldt University of Berlin; Goethe University Frankfurt; University of Twente; University of Bonn
摘要：We consider a stochastic online problem where n applicants arrive over time, one per time step. Upon the arrival of each applicant, their cost per time step is revealed, and we have to fix the duration of employment, starting immediately. This decision is irrevocable; that is, we can neither extend a contract nor dismiss a candidate once hired. In every time step, at least one candidate needs to be under contract, and our goal is to minimize the total hiring cost, which is the sum of the appli...
-
作者：Jansen, Klaus; Klein, Kim-Manuel; Verschae, Jose
作者单位：University of Kiel; Universidad de O'Higgins
摘要：Makespan scheduling on identical machines is one of the most basic and fundamental packing problems studied in the discrete optimization literature. It asks for an assignment of n jobs to a set of m identical machines that minimizes the makespan. The problem is strongly NP-hard, and thus we do not expect a (1 + epsilon)-approximation algorithm with a running time that depends polynomially on 1/epsilon. It has been recently shown that a subexponential running time on 1/epsilon would imply that ...
-
作者：Zanger, Daniel Z.
摘要：We establish error estimates for the Longstaff-Schwartz algorithm, employing just a single set of independent Monte Carlo sample paths that is reused for all exercise time steps. We obtain, within the context of financial derivative payoff functions bounded according to the uniform norm, new bounds on the stochastic part of the error of this algorithm for an approximation architecture that may be any arbitrary set of L-2 functions of finite Vapnik-Chervonenkis (VC) dimension whenever the algor...
-
作者：Ernst, Philip A.; Rogers, L. C. G.
作者单位：Rice University; University of Cambridge
摘要：An investor may invest in a riskless bank account and in a stock that is a standard Black-Scholes asset with occasional Gaussian jumps of the log price, as proposed by Merton [Merton RC (1976) Option pricing when underlying stock returns are discontinuous. J. Financial Econom. 3(1):125-144.]. It is well known how to solve the standard running consumption problem for this investor, which we take as a benchmark for comparing the performance of two different insiders, one who knows in advance of ...
-
作者：Blanchet, Jose; Chen, Xinyun
作者单位：Stanford University; The Chinese University of Hong Kong, Shenzhen
摘要：We provide the first rate of convergence to stationarity analysis for reflected Brownian motion (RBM) as the dimension grows under some uniformity conditions. In particular, if the underlying routing matrix is uniformly contractive, uniform stability of the drift vector holds, and the variances of the underlying Brownian motion (BM) are bounded, then we show that the RBM converges exponentially fast to stationarity with a relaxation time of order O(d(4)(log(d))(3)) as the dimension d -> infini...
-
作者：Dadush, Daniel; Vegh, Laszlo A.; Zambelli, Giacomo
作者单位：University of London; London School Economics & Political Science
摘要：We propose simple polynomial-time algorithms for two linear conic feasibility problems. For a matrix A is an element of R-mxn, the kernel problem requires a positive vector in the kernel of A, and the image problem requires a positive vector in the image of A(T). Both algorithms iterate between simple first-order steps and resealing steps. These rescalings improve natural geometric potentials. If Goffin's condition measure rho(A) is negative, then the kernel problem is feasible, and the worst-...
-
作者：Bade, Sophie
作者单位：University of London; Royal Holloway University London; Max Planck Society
摘要：Fix a Pareto-optimal, strategy-proof, and nonbossy deterministic matching mechanism and define a random matching mechanism by assigning agents to the roles in the mechanism via a uniform lottery. Given a profile of preferences, the lottery over outcomes that arises under the random matching mechanism is identical to the lottery that arises under random serial dictatorship, where the order of dictators is uniformly distributed. This result extends the celebrated equivalence between the core fro...
-
作者：Xu, Zuo Quan; Yi, Fahuai
作者单位：Hong Kong Polytechnic University; Guangdong University of Foreign Studies
摘要：In practice, one must recognize the inevitable incompleteness of information while making decisions. In this paper, we consider the optimal redeeming problem of stock loans under a state of incomplete information presented by the uncertainty in the (bull or bear) trends of the underlying stock. This is called drift uncertainty. Owing to the unavoidable need for the estimation of trends while making decisions, the related Hamilton-Jacobi-Bellman equation turns out to be of a degenerate paraboli...
-
作者：Kim, Michael Jong
作者单位：University of British Columbia
摘要：Sequential Bayesian optimization constitutes an important and broad class of problems where model parameters are not known a priori but need to be learned over time using Bayesian updating. It is known that the solution to these problems can in principle be obtained by solving the Bayesian dynamic programming (BDP) equation. Although the BDP equation can be solved in certain special cases (for example, when posteriors have low-dimensional representations), solving this equation in general is c...
-
作者：Federgruen, Awi; Liu, Zhe; Lu, Lijian
作者单位：Columbia University
摘要：We address a general periodic review inventory control model with the simultaneous presence of the following complications: (a) bilateral inventory adjustment options, via procurement orders and salvage sales or returns to the supplier; (b) fixed costs associated with procurement orders and downward inventory adjustments (via salvage sales or returns); and (c) capacity limits associated with upward or downward inventory adjustments. We characterize the optimal adjustment strategy, both for fin...
