| 1 | -- | 5 | Hamed Amini, Damir Filipovic, Andreea Minca. Uniqueness of equilibrium in a payment system with liquidation costs |
| 6 | -- | 11 | Grani Adiwena Hanasusanto, Daniel Kuhn, Wolfram Wiesemann. K-adaptability in two-stage distributionally robust binary programming |
| 12 | -- | 18 | Xiaoping Lu, Endah R. M. Putri. Finite maturity margin call stock loans |
| 19 | -- | 24 | Guillaume Vigeral, Yannick Viossat. Semi-algebraic sets and equilibria of binary games |
| 25 | -- | 32 | Kyle Y. Lin, Dashi I. Singham. Finding a hider by an unknown deadline |
| 33 | -- | 38 | A. A. Elsadany, A. M. Awad. Dynamical analysis of a delayed monopoly game with a log-concave demand function |
| 39 | -- | 43 | Kunikazu Yoda, András Prékopa. Improved bounds on the probability of the union of events some of whose intersections are empty |
| 44 | -- | 49 | Guangxin Jiang, Chenglong Xu, Michael C. Fu. On sample average approximation algorithms for determining the optimal importance sampling parameters in pricing financial derivatives on Lévy processes |
| 50 | -- | 53 | Yan-An Hwang, Rui-Xian Liao. A dynamic process to the core for multi-choice games |
| 54 | -- | 58 | Ana Meca, Greys Sosic. On supremum-norm cost games |
| 59 | -- | 60 | Hamza Fawzi, João Gouveia, Richard Z. Robinson. Rational and real positive semidefinite rank can be different |
| 61 | -- | 66 | Amir Beck, Luba Tetruashvili, Yakov Vaisbourd, Ariel Shemtov. Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems |
| 67 | -- | 73 | Miguel A. Goberna, Vaithilingam Jeyakumar, G. Li, N. Linh. Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints |
| 74 | -- | 79 | Jianghua Wu, Ananth Iyer, Paul V. Preckel. Information visibility and its impact in a supply chain |
| 80 | -- | 85 | D. Antony Tarvin, R. Kevin Wood, Alexandra M. Newman. Benders decomposition: Solving binary master problems by enumeration |
| 86 | -- | 91 | Genjiu Xu, Han Dai, Dongshuang Hou, Hao Sun. A-potential function and a non-cooperative foundation for the Solidarity value |
| 92 | -- | 95 | Yuan Gao, Jinjiang Yuan. Unary NP-hardness of minimizing total weighted tardiness with generalized due dates |
| 96 | -- | 100 | Warut Suksompong. Scheduling asynchronous round-robin tournaments |
| 101 | -- | 106 | Misikir Eyob Gebrehiwot, Samuli Aalto, Pasi E. Lassila. Energy-performance trade-off for processor sharing queues with setup delay |
| 107 | -- | 108 | Jay Sethuraman. An alternative proof of a characterization of the TTC mechanism |
| 109 | -- | 113 | Eran Simhon, Yezekael Hayel, David Starobinski, Quanyan Zhu. Optimal information disclosure policies in strategic queueing games |
| 114 | -- | 120 | Dimitris Bertsimas, Ebrahim Nasrabadi, James B. Orlin. On the power of randomization in network interdiction |
| 121 | -- | 128 | Lingfei Li, Rafael Mendoza-Arriaga, Daniel Mitchell. Analytical representations for the basic affine jump diffusion |
| 129 | -- | 135 | Daniel Wei-Chung Miao, Xenos Chang-Shuo Lin, Steve Hsin-Ting Yu. A note on the never-early-exercise region of American power exchange options |
| 136 | -- | 142 | Paul H. Zipkin. Some specially structured assemble-to-order systems |
| 143 | -- | 147 | Anna B. Khmelnitskaya, Özer Selçuk, Dolf Talman. The Shapley value for directed graph games |
| 148 | -- | 151 | Yogendra Pandey, S. K. Mishra. On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints |