1期

最新文章

• Auction Design for the Efficient Allocation of Service Capacity Under Congestion AI翻译
  作者：Barrera, Jorge; Garcia, Alfredo
  作者单位：University of Virginia; State University System of Florida; University of Florida
  摘要：We consider the problem of efficiently allocating the capacity of a number of service facilities (prone to congestion) to a set of users with private information regarding their willingness to pay for different combinations of throughput versus latency. Auction mechanisms can be used to schedule the service capacity of available facilities. However, the interdependency of users' valuations implies that simple uniform price adjustment processes (e.g., tatonnement) either fail to effectively cle...
• The Post-Disaster Debris Clearance Problem Under Incomplete Information AI翻译
  作者：Celik, Melih; Ergun, Ozlem; Keskinocak, Pinar
  作者单位：Middle East Technical University; Northeastern University; University System of Georgia; Georgia Institute of Technology
  摘要：Debris management is one of the most time consuming and complicated activities among post-disaster operations. Debris clearance is aimed at pushing the debris to the sides of the roads so that relief distribution and search-and-rescue operations can be maintained in a timely manner. Given the limited resources, uncertainty, and urgency during disaster response, efficient and effective planning of debris clearance to achieve connectivity between relief demand and supply is important. In this pa...
• An Exact Decomposition Approach for the Real-Time Train Dispatching Problem AI翻译
  作者：Lamorgese, Leonardo; Mannino, Carlo
  作者单位：SINTEF
  摘要：Trains' movements on a railway network are regulated by official timetables. Deviations and delays occur quite often in practice, demanding fast rescheduling and rerouting decisions in order to avoid conflicts and minimize overall delay. This is the real-time train dispatching problem. In contrast with the classic holistic approach, we show how to decompose the problem into smaller subproblems associated with the line and the stations. This decomposition is the basis for a master-slave solutio...
• Demand Estimation and Ordering Under Censoring: Stock-Out Timing Is (Almost) All You Need AI翻译
  作者：Jain, Aditya; Rudi, Nils; Wang, Tong
  作者单位：Indian School of Business (ISB); INSEAD Business School; National University of Singapore
  摘要：Retailers facing uncertain demand can use observed sales to update demand estimates. However, such learning is limited by the amount of inventory carried; when demand exceeds inventory (i.e., when a stock-out event occurs), a retailer in general cannot observe actual demand. We propose using observations on the timing of sales occurrences in a Bayesian fashion to learn about demand, and we analyze this learning method for a multiperiod newsvendor setting. We find that, as previously shown with...
• The Benefit of Introducing Variability in Single-Server Queues with Application to Quality-Based Service Domains AI翻译
  作者：Xu, Ying; Scheller-Wolf, Alan; Sycara, Katia
  作者单位：Carnegie Mellon University; Carnegie Mellon University
  摘要：We propose a static service differentiation policy for a single-server queueing system serving homogeneous customers. We show that by randomly assigning customers different service grades with different service rates, the average waiting time can be reduced without affecting the mean service time. Such differentiation introduces more service time variability, but it also creates information that enables the implementation of service rate-based scheduling, which mitigates the increased variance...
• Time to Come Clean? Disclosure and Inspection Policies for Green Production AI翻译
  作者：Kim, Sang-Hyun
  作者单位：Yale University
  摘要：We examine the interplay between two important decisions that impact environmental performance in a production setting: inspections performed by a regulator and noncompliance disclosure by a production firm. To preempt the penalty that will be levied once a compliance violation is discovered in an inspection, the firm dynamically decides whether it should disclose a random occurrence of noncompliance. Anticipating this, the regulator determines inspection frequency and penalty amounts to minim...
• Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object AI翻译
  作者：Alpern, Steve A; Lidbetter, Thomas
  作者单位：University of Warwick; University of London; London School Economics & Political Science
  摘要：A Searcher seeks to find a stationary Hider located at some point H (not necessarily a node) on a given network Q. The Searcher can move along the network from a given starting point at unit speed, but to actually find the Hider she must pass it while moving at a fixed slower speed (which may depend on the arc). In this bimodal search game, the payoff is the first time the Searcher passes the Hider while moving at her slow speed. This game models the search for a small or well hidden object (e...
• A General Attraction Model and Sales-Based Linear Program for Network Revenue Management Under Customer Choice AI翻译
  作者：Gallego, Guillermo; Ratliff, Richard; Shebalov, Sergey
  作者单位：Columbia University
  摘要：This paper addresses two concerns with the state of the art in network revenue management with dependent demands. The first concern is that the basic attraction model (BAM), of which the multinomial logit (MNL) model is a special case, tends to overestimate demand recapture in practice. The second concern is that the choice-based deterministic linear program, currently in use to derive heuristics for the stochastic network revenue management problem, has an exponential number of variables. We ...
• A Tailor-Made Test of Intransitive Choice AI翻译
  作者：Baillon, Aurelien; Bleichrodt, Han; Cillo, Alessandra
  作者单位：Erasmus University Rotterdam; Erasmus University Rotterdam - Excl Erasmus MC; Bocconi University; Bocconi University
  摘要：This paper reports a new test of intransitive choice using individual measurements of regret-and similarity-based intransitive models of choice under uncertainty. Our test is tailor-made and uses subject-specific stimuli. Despite these features, we observed only a few intransitivities. A possible explanation for the poor predictive performance of intransitive choice models is that they only allow for interactions between acts. They exclude within-act interactions by retaining the assumption th...
• Strategic Arrivals into Queueing Networks: The Network Concert Queueing Game AI翻译
  作者：Honnappa, Harsha; Jain, Rahul
  作者单位：Purdue University System; Purdue University; University of Southern California; University of Southern California
  摘要：Queueing networks models typically assume that the arrival process is exogenous and unaffected by admission control, scheduling policies, etc. In many situations, however, users choose the time of their arrival strategically, taking delay and other metrics into account. In this paper, we develop a framework to study such strategic arrivals into queueing networks. We study the population game wherein users strategically choose when to arrive at a parallel queueing network and upon arrival, whic...