1 | -- | 13 | Shahar Dobzinski, Noam Nisan, Michael Schapira. Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders |
14 | -- | 26 | Miguel A. Goberna, Tamás Terlaky, Maxim I. Todorov. Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions |
27 | -- | 51 | Bernd Heidergott, Haralambie Leahu. Weak Differentiability of Product Measures |
52 | -- | 78 | Arkadi Nemirovski, Shmuel Onn, Uriel G. Rothblum. Accuracy Certificates for Computational Problems with Convex Structure |
79 | -- | 101 | Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan. A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems |
102 | -- | 119 | Serguei Foss, Andrew Richards. On Sums of Conditionally Independent Subexponential Random Variables |
120 | -- | 139 | Shu Lu. Variational Conditions Under the Constant Rank Constraint Qualification |
140 | -- | 159 | Erhan Bayraktar, Masahiko Egami. On the One-Dimensional Optimal Switching Problem |
160 | -- | 172 | Glenn Merlet. Memory Loss Property for Products of Random Matrices in the Max-Plus Algebra |
173 | -- | 192 | Anna Bogomolnaia, Ron Holzman, Hervé Moulin. Sharing the Cost of a Capacity Network |
193 | -- | 207 | János Flesch, J. Kuipers, Gijs Schoenmakers, Koos Vrieze. Subgame Perfection in Positive Recursive Games with Perfect Information |
208 | -- | 232 | Simai He, Jiawei Zhang, Shuzhong Zhang. Bounding Probability of Small Deviation: A Fourth Moment Approach |
233 | -- | 256 | Kent Andersen, Quentin Louveaux, Robert Weismantel. An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets |