Math. Program.

Keyphrases

Publications

volume 204, number 1, 2024

Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Diverse collections in matroids and graphs. Math. Program. 204 (1) (2024)
Ziyu He, Shaoning Han, Andrés Gómez, Ying Cui, Jong-Shi Pang
Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix. Math. Program. 204 (1) (2024)
Yuni Iwamasa
A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2 ˟ 2 submatrices. Math. Program. 204 (1) (2024)
Tongseok Lim
Geometry of vectorial martingale optimal transportations and duality. Math. Program. 204 (1) (2024)
Azam Asl, Haihao Lu, Jinwen Yang
A J-symmetric quasi-newton method for minimax problems. Math. Program. 204 (1) (2024)
Nikita Doikov, Yurii E. Nesterov
Gradient regularization of Newton method with Bregman distances. Math. Program. 204 (1) (2024)
Ilias Zadik, Miles Lubin, Juan Pablo Vielma
Shapes and recession cones in mixed-integer convex representability. Math. Program. 204 (1) (2024)
Bertrand Guenin, Cheolwon Heo
Small separations in pinch-graphic matroids. Math. Program. 204 (1) (2024)
Timm Oertel, Joseph Paat, Robert Weismantel
A colorful Steinitz Lemma with application to block-structured integer programs. Math. Program. 204 (1) (2024)
Shuvomoy Das Gupta, Bart P. G. Van Parys, Ernest K. Ryu
Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods. Math. Program. 204 (1) (2024)
Bruno F. Lourenço, Vera Roshchina, James Saunderson
Hyperbolicity cones are amenable. Math. Program. 204 (1) (2024)
Bochuan Lyu, Illya V. Hicks, Joey Huchette
Modeling combinatorial disjunctive constraints via junction trees. Math. Program. 204 (1) (2024)
Linchuan Wei, Alper Atamtürk, Andrés Gómez, Simge Küçükyavuz
On the convex hull of convex quadratic optimization problems with indicators. Math. Program. 204 (1) (2024)
Digvijay Boob, Cristóbal Guzmán
Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems. Math. Program. 204 (1) (2024)
Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur
Approximation algorithms for flexible graph connectivity. Math. Program. 204 (1) (2024)
Tianyun Tang, Kim-Chuan Toh
Solving graph equipartition SDPs on an algebraic variety. Math. Program. 204 (1) (2024)
Norihide Tokushige
The maximum measure of non-trivial 3-wise intersecting families. Math. Program. 204 (1) (2024)
Jean-François Aujol, Charles Dossal, Aude Rondepierre
FISTA is an automatic geometrically optimized algorithm for strongly convex functions. Math. Program. 204 (1) (2024)
Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. Math. Program. 204 (1) (2024)
Shuvomoy Das Gupta, Bart P. G. Van Parys, Ernest K. Ryu
Publisher Correction: Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods. Math. Program. 204 (1) (2024)
Bertrand Guenin, Cheolwon Heo
Recognizing pinch-graphic matroids. Math. Program. 204 (1) (2024)

volume 203, number 1, 2024

Haris Aziz, Bo Li, Xiaowei Wu
Approximate and strategyproof maximin share allocation of chores with ordinal preferences. Math. Program. 203 (1) (2024)
Tobias Harks, Anja Schedel
Stackelberg pricing games with congestion effects. Math. Program. 203 (1) (2024)
Luis Sánchez Fernández, Norberto Fernández García, Jesús A. Fisteus, Markus Brill
The maximin support method: an extension of the D'Hondt method to approval-based multiwinner elections. Math. Program. 203 (1) (2024)
William Thomson, Rodrigo A. Velez
Consistent queueing rules. Math. Program. 203 (1) (2024)
Mourad Baïou, José R. Correa, Rida Laraki
Mathematical Optimization for Fair Social Decisions: A Tribute to Michel Balinski. Math. Program. 203 (1) (2024)
Gabrielle Demange
On the resolution of cross-liabilities. Math. Program. 203 (1) (2024)
Frédéric Koessler, Marie Laclau, Jérôme Renault, Tristan Tomala
Splitting games over finite sets. Math. Program. 203 (1) (2024)
Bart Smeulders, Danny Blom, Frits C. R. Spieksma
Identifying optimal strategies in kidney exchange games is $\varSigma _2^p$-complete. Math. Program. 203 (1) (2024)
Panayotis Mertikopoulos, Ya-Ping Hsieh, Volkan Cevher
A unified stochastic approximation framework for learning in games. Math. Program. 203 (1) (2024)
Paul H. Edelman, Martin Van der Linden, John A. Weymark
The core of a transferable utility game as the solution to a public good market demand problem. Math. Program. 203 (1) (2024)
Andrew B. Jennings, Rida Laraki, Clemens Puppe, Estelle Marine Varloot
New characterizations of strategy-proofness under single-peakedness. Math. Program. 203 (1) (2024)
Ayumi Igarashi, William S. Zwicker
Fair division of graphs and of tangled cakes. Math. Program. 203 (1) (2024)
P. Jean-Jacques Herings, Yang Zhan
The computation of pairwise stable networks. Math. Program. 203 (1) (2024)
Roberto Cominetti, Valerio Dose, Marco Scarsini
The price of anarchy in routing games as a function of the demand. Math. Program. 203 (1) (2024)
Elizabeth Baldwin, Martin Bichler, Maximilian Fichtl, Paul Klemperer
Strong substitutes: structural properties, and a new algorithm for competitive equilibrium prices. Math. Program. 203 (1) (2024)
Haris Aziz, Anton Baychkov, Péter Biró
Cutoff stability under distributional constraints with an application to summer internship matching. Math. Program. 203 (1) (2024)
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
-connected medians. Math. Program. 203 (1) (2024)
Etienne Boursier, Vianney Perchet
Utility/privacy trade-off as regularized optimal transport. Math. Program. 203 (1) (2024)
Sylvain Sorin
No-regret algorithms in on-line learning, games and convex optimization. Math. Program. 203 (1) (2024)
Ioannis Caragiannis, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Kristoffer Arnsfelt Hansen, Zihan Tan
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship. Math. Program. 203 (1) (2024)
Michel Grabisch, Peter Sudhölter
Characterization of TU games with stable cores by nested balancedness. Math. Program. 203 (1) (2024)
Galit Ashkenazi-Golan, Ilia Krasikov, Catherine Rainer, Eilon Solan
Absorption paths and equilibria in quitting games. Math. Program. 203 (1) (2024)
Antoine Lagarde, Tristan Tomala
Optimality and fairness of partisan gerrymandering. Math. Program. 203 (1) (2024)
Ivonne Callejas, Srihari Govindan, Lucas Pahl
A finite characterization of perfect equilibria. Math. Program. 203 (1) (2024)
P. Jean-Jacques Herings, Yang Zhan
Correction to: The computation of pairwise stable networks. Math. Program. 203 (1) (2024)
Antonio Palomares, Friedrich Pukelsheim, Victoriano Ramírez-González
Note on axiomatic properties of apportionment methods for proportional representation systems. Math. Program. 203 (1) (2024)
Dehia Ait-Ferhat, Zoltán Király, András Sebö, Gautier Stauffer
How many matchings cover the nodes of a graph? Math. Program. 203 (1) (2024)
Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner
Phragmén's voting methods and justified representation. Math. Program. 203 (1) (2024)
Claire Mathieu, Victor Verdugo
Apportionment with parity constraints. Math. Program. 203 (1) (2024)