-
作者：Aouad, Ali; Saritac, Omer
作者单位：University of London; London Business School
摘要：In centralized matching markets such as carpooling platforms and kidney exchange schemes, new participants constantly enter the market and remain available for potential matches during a limited period of time. To reach an efficient allocation, the ???timing??? of the matching decisions is a critical aspect of the platform???s operations. There is a fundamental tradeoff between increasing market thickness and mitigating the risk that participants abandon the market. Nonetheless, the dynamic pr...
-
作者：Sandomirskiy, Fedor; Segal-Halevi, Erel
作者单位：California Institute of Technology; HSE University (National Research University Higher School of Economics); Ariel University
摘要：A collection of objects, some of which are good and some of which are bad, is to be divided fairly among agents with different tastes, modeled by additive utility functions. If the objects cannot be shared, so that each of them must be entirely allocated to a single agent, then a fair division may not exist. What is the smallest number of objects that must be shared between two or more agents to attain a fair and efficient division? In this paper, fairness is understood as proportionality or e...
-
作者：Qu, Zihao; Dawande, Milind; Janakiraman, Ganesh
作者单位：University of Texas System; University of Texas Dallas; University of Texas System; University of Texas Dallas; University of Texas System; University of Texas Dallas
摘要：Motivated by an application at a postacute healthcare provider, we study an infinite-horizon, stochastic optimization problem with a set of long-term capacity investment decisions and a sequence of real-time order acceptance/rejection decisions. The goal is to maximize the long-run average expected profit per period. The firm employs full-time resources of various kinds, such as nurses and therapists. For each kind of resource, multiple types are available. For example, registered nurses (RNs)...
-
作者：Eckles, Dean; Esfandiari, Hossein; Mossel, Elchanan; Rahimian, M. Amin
作者单位：Massachusetts Institute of Technology (MIT); Alphabet Inc.; Google Incorporated; Massachusetts Institute of Technology (MIT); Pennsylvania Commonwealth System of Higher Education (PCSHE); University of Pittsburgh
摘要：We study the task of selecting k nodes, in a social network of size n, to seed a diffusion with maximum expected spread size, under the independent cascade model with cascade probability p. Most of the previous work on this problem (known as influence maximization) focuses on efficient algorithms to approximate the optimal seed set with provable guarantees given knowledge of the entire network; however, obtaining full knowledge of the network is often very costly in practice. Here we develop a...
-
作者：Wu, Lingxiao; Adulyasak, Yossiri; Cordeau, Jean-Francois; Wang, Shuaian
作者单位：Universite de Montreal; Universite de Montreal; HEC Montreal; Hong Kong Polytechnic University
摘要：Berth allocation and pilotage planning are the two most important decisions made by a seaport for serving incoming vessels. Traditionally, the berth allocation problem and the pilotage planning problem are solved sequentially, leading to suboptimal or even infeasible solutions for vessel services. This paper investigates a vessel service planning problem (VSPP) in seaports that addresses berth allocation and pilotage planning in combination. We introduce a compact mixed-integer linear programm...
-
作者：Zhalechian, Mohammad; Keyvanshokooh, Esmaeil; Shi, Cong; Van Oyen, Mark P.
作者单位：University of Michigan System; University of Michigan; Texas A&M University System; Texas A&M University College Station
摘要：Joint online learning and resource allocation is a fundamental problem inherent in many applications. In a general setting, heterogeneous customers arrive sequentially, each of which can be allocated to a resource in an online fashion. Customers stochastically consume the resources, allocations yield stochastic rewards, and the system receives feedback outcomes with delay. We introduce a generic framework that judiciously synergizes online learning with a broad class of online resource allocat...
-
作者：Abbas, Ali E.; Bell, David E.
作者单位：University of Southern California; Harvard University
摘要：When our successors write about thefirst century of Operations Research, thename of Kenneth Arrow will be in lights. It isfitting that at this time, not long after his death,that we take a moment to consider Ken Arrow's academic legacy. This introduction to theSpecial Issue honoring Ken Arrow highlights his contributions in thefield of OperationsResearch and summarizes the papers published in the special issue that speak to his legacy.
-
作者：Dal Sasso, Veronica; Lamorgese, Leonardo; Mannino, Carlo; Tancredi, Antonio; Ventura, Paolo
作者单位：SINTEF; University of Oslo; Consiglio Nazionale delle Ricerche (CNR)
摘要：A deadlock occurs when two or more trains are preventing each other from moving forward by occupying the required tracks. Deadlocks are rare but pernicious events in railroad operations and, in most cases, are caused by human errors. Recovering is a time-consuming and costly operation, producing large delays and often requiring crew rescheduling and complex switching moves. In practice, most deadlocks involve only two long trains missing their last potential meet location. In this paper, we pr...
-
作者：Hunter, David Scott; Zaman, Tauhid
作者单位：Massachusetts Institute of Technology (MIT); Yale University
摘要：We consider the problem of optimizing the placement of stubborn agents in a social network in order to maximally influence the population. We assume the network contains stubborn users whose opinions do not change, and nonstubborn users who can be persuaded. We further assume that the opinions in the network are in an equilibrium that is common to many opinion dynamics models, including the well-known DeGroot model. We develop a discrete optimization formulation for the problem of maximally sh...
-
作者：Pavone, Marco; Saberi, Amin; Schiffer, Maximilian; Tsao, Matt Wu
作者单位：Stanford University; Stanford University; Technical University of Munich; Technical University of Munich; Stanford University
摘要：We study an online hypergraph matching problem inspired by ridesharing and delivery applications. The vertices of a hypergraph are revealed sequentially and must be matched shortly thereafter, otherwise they will leave the system in favor of an outside option. Hyperedges are revealed to the algorithm once all of its vertices have arrived, and can only be included into the matching before any of its vertices leave the system. The cardinality of hyperedges are bounded by a small constant which r...
