-
作者：Chen, Jingnan; Feng, Liming; Peng, Jiming; Ye, Yinyu
作者单位：University of Illinois System; University of Illinois Urbana-Champaign; University of Houston System; University of Houston; Stanford University
摘要：In this paper, we consider an optimal portfolio deleveraging problem, where the objective is to meet specified debt/equity requirements at the minimal execution cost. Permanent and temporary price impact is taken into account. With no restrictions on the relative magnitudes of permanent and temporary price impact, the optimal deleveraging problem reduces to a nonconvex quadratic program with quadratic and box constraints. Analytical results on the optimal deleveraging strategy are obtained. Th...
-
作者：Kothiyal, Amit; Spinu, Vitalie; Wakker, Peter P.
作者单位：Max Planck Society; University of California System; University of California Los Angeles; Erasmus University Rotterdam; Erasmus University Rotterdam - Excl Erasmus MC
摘要：This paper provides necessary and sufficient preference conditions for average utility maximization over sequences of variable length. We obtain full generality by using a new algebraic technique that exploits the richness structure naturally provided by the variable length of the sequences. Thus we generalize many preceding results in the literature. For example, continuity in outcomes, a condition needed in other approaches, now is an option rather than a requirement. Applications to expecte...
-
作者：Karger, David R.; Oh, Sewoong; Shah, Devavrat
作者单位：Massachusetts Institute of Technology (MIT); University of Illinois System; University of Illinois Urbana-Champaign
摘要：Crowdsourcing systems, in which numerous tasks are electronically distributed to numerous information pieceworkers, have emerged as an effective paradigm for human-powered solving of large-scale problems in domains such as image classification, data entry, optical character recognition, recommendation, and proofreading. Because these low-paid workers can be unreliable, nearly all such systems must devise schemes to increase confidence in their answers, typically by assigning each task multiple...
-
作者：Battarra, Maria; Erdogan, Guenes; Vigo, Daniele
作者单位：University of Southampton; University of Southampton; University of Bologna
摘要：This study presents new exact algorithms for the clustered vehicle routing problem (CluVRP). The CluVRP is a generalization of the capacitated vehicle routing problem (CVRP), in which the customers are grouped into clusters. As in the CVRP, all the customers must be visited exactly once, but a vehicle visiting one customer in a cluster must visit all the remaining customers therein before leaving it. Based on an exponential time preprocessing scheme, an integer programming formulation for the ...
