Mathematics of Operations Research

最新文章

• BROWNIAN EXCURSION, THE M-M-1 QUEUE AND THEIR OCCUPATION TIMES AI翻译
  作者：COHEN, JW; HOOGHIEMSTRA, G
• MINIMIZATION BY RANDOM SEARCH TECHNIQUES AI翻译
  作者：SOLIS, FJ; WETS, RJB
• ON PIECEWISE LINEAR FUNCTIONS AND PIECEWISE LINEAR EQUATIONS AI翻译
  作者：SCHRAMM, R
• COMBINATORIAL OPTIMIZATION - WHAT IS THE STATE OF THE ART AI翻译
  作者：KLEE, V
• CONVERGENT ALGORITHMS FOR MINIMIZING A CONCAVE FUNCTION AI翻译
  作者：VANTHOAI, N; TUY, H
• SOME USEFUL FUNCTIONS FOR FUNCTIONAL LIMIT-THEOREMS AI翻译
  作者：WHITT, W
• Approximation Algorithms for Steiner Connectivity Augmentation AI翻译
  作者：Hathcock, Daniel; Zlatin, Michael
  作者单位：Carnegie Mellon University; Carnegie Mellon University
  摘要：We consider connectivity augmentation problems in the Steiner setting. In the Steiner Augmentation of a Graph problem (k-SAG), we are given a k-edge-connected graph H, which we seek to augment by including links of minimum cost so that the edge connectivity between nodes of H increases by 1. Unlike the standard Connectivity Augmentation Problem, links to Steiner nodes outside H are available for the augmentation. If H is not assumed to be globally k-edge connected but rather Steiner k-edge con...
• Minimum Cost Adaptive Submodular Cover AI翻译
  作者：Al-Thani, Hessa; Cui, Yubing; Harris, Blake; Nagarajan, Viswanath
  作者单位：University of Michigan; University of Michigan System; University of Michigan; Massachusetts Institute of Technology (MIT)
  摘要：Adaptive submodularity is a fundamental concept in stochastic optimization, with numerous applications such as sensor placement, hypothesis identification, and viral marketing. We consider the problem of covering an adaptive submodular function at minimum expected cost, where the random realizations of different items may be correlated. We show that the natural greedy policy has an approximation ratio of 4 center dot (1 + ln Q), where Q is the goal value. We also show that the greedy policy ha...
• On the Monotonicity and Rate of Convergence of the Markovian Persuasion Value AI翻译
  作者：Shaiderman, Dimitry
  作者单位：Hebrew University of Jerusalem
  摘要：We study a dynamic Bayesian persuasion model called Markovian persuasion, illustrated here with two players: the sender (he) and the receiver (she). In such a model, the belief of the receiver regarding the current state of a Markov chain (X-n)(n >= 1), over a finite state space K, is controlled through signals she obtains from a sender, who observes (X-n)(n >= 1) in real time. At each stage n >= 1, the receiver takes an action based on his current belief, which, together with the realized sta...
• On Time-Consistent Equilibrium Stopping Under Aggregation of Diverse Discount Rates AI翻译
  作者：Deng, Shuoqing; Yu, Xiang; Zhang, Jiacheng
  作者单位：Hong Kong University of Science & Technology; Hong Kong Polytechnic University; Chinese University of Hong Kong
  摘要：This paper studies a central planner's decision making on behalf of a group of members with diverse discount rates. In the context of optimal stopping, we work with an aggregation preference to incorporate all discount rates via an attitude function that reflects the aggregation rule chosen by the central planner. The resulting optimal stopping problem is time-inconsistent, for which we develop an iterative approach using consistent planning and characterize all time-consistent mild equilibria...