| 1 | -- | 7 | Mourad Baïou, José R. Correa, Rida Laraki. Mathematical Optimization for Fair Social Decisions: A Tribute to Michel Balinski |
| 9 | -- | 45 | Antoine Lagarde, Tristan Tomala. Optimality and fairness of partisan gerrymandering |
| 47 | -- | 76 | Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner. Phragmén's voting methods and justified representation |
| 77 | -- | 105 | Markus Brill, Paul Gölz, Dominik Peters, Ulrike Schmidt-Kraepelin, Kai Wilker. Approval-based apportionment |
| 107 | -- | 134 | Luis Sánchez Fernández 0001, 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 |
| 135 | -- | 168 | Claire Mathieu, Victor Verdugo. Apportionment with parity constraints |
| 169 | -- | 185 | Antonio Palomares, Friedrich Pukelsheim, Victoriano Ramírez-González. Note on axiomatic properties of apportionment methods for proportional representation systems |
| 187 | -- | 205 | Raphael Reitzig, Sebastian Wild. A simple and fast linear-time algorithm for divisor methods of apportionment |
| 207 | -- | 238 | Andrew B. Jennings, Rida Laraki, Clemens Puppe, Estelle Marine Varloot. New characterizations of strategy-proofness under single-peakedness |
| 239 | -- | 246 | Michel Balinski, Victoriano Ramirez. Why webster? |
| 247 | -- | 269 | Haris Aziz 0001, Anton Baychkov, Péter Biró 0001. Cutoff stability under distributional constraints with an application to summer internship matching |
| 271 | -- | 284 | Dehia Ait-Ferhat, Zoltán Király, András Sebö, Gautier Stauffer. How many matchings cover the nodes of a graph? |
| 285 | -- | 318 | Andrea Lodi 0001, Philippe Olivier, Gilles Pesant, Sriram Sankaranarayanan 0002. Fairness over time in dynamic resource allocation with an application in healthcare |
| 319 | -- | 345 | Haris Aziz 0001, Bo Li, Xiaowei Wu 0001. Approximate and strategyproof maximin share allocation of chores with ordinal preferences |
| 347 | -- | 368 | Bart Smeulders, Danny Blom, Frits C. R. Spieksma. Identifying optimal strategies in kidney exchange games is $\varSigma _2^p$-complete |
| 369 | -- | 420 | Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès. p-connected medians |
| 421 | -- | 442 | Hassene Aissi, Ali Ridha Mahjoub. On the minimum s-t cut problem with budget constraints |
| 443 | -- | 473 | P. Jean-Jacques Herings, Yang Zhan 0006. The computation of pairwise stable networks |
| 475 | -- | 476 | P. Jean-Jacques Herings, Yang Zhan 0006. Correction to: The computation of pairwise stable networks |
| 477 | -- | 498 | Frédéric Koessler, Marie Laclau, Jérôme Renault, Tristan Tomala. Splitting games over finite sets |
| 499 | -- | 529 | Bainian Hao, Carla Michini. The price of Anarchy in series-parallel network congestion games |
| 531 | -- | 558 | Roberto Cominetti, Valerio Dose, Marco Scarsini. The price of anarchy in routing games as a function of the demand |
| 559 | -- | 609 | Panayotis Mertikopoulos, Ya-Ping Hsieh, Volkan Cevher. A unified stochastic approximation framework for learning in games |
| 611 | -- | 643 | Elizabeth Baldwin, Martin Bichler, Maximilian Fichtl, Paul Klemperer. Strong substitutes: structural properties, and a new algorithm for competitive equilibrium prices |
| 645 | -- | 686 | Sylvain Sorin. No-regret algorithms in on-line learning, games and convex optimization |
| 687 | -- | 702 | 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 |
| 703 | -- | 726 | Etienne Boursier, Vianney Perchet. Utility/privacy trade-off as regularized optimal transport |
| 727 | -- | 734 | Ivonne Callejas, Srihari Govindan, Lucas Pahl. A finite characterization of perfect equilibria |
| 735 | -- | 762 | Galit Ashkenazi-Golan, Ilia Krasikov, Catherine Rainer, Eilon Solan. Absorption paths and equilibria in quitting games |
| 763 | -- | 799 | Tobias Harks, Anja Schedel. Stackelberg pricing games with congestion effects |
| 801 | -- | 826 | Michel Grabisch, Peter Sudhölter. Characterization of TU games with stable cores by nested balancedness |
| 827 | -- | 856 | Gabrielle Demange. On the resolution of cross-liabilities |
| 857 | -- | 869 | William Thomson, Rodrigo A. Velez. Consistent queueing rules |
| 871 | -- | 900 | Ioannis Caragiannis, Aris Filos-Ratsikas, Swaprava Nath, Alexandros A. Voudouris. Truthful ownership transfer with expert advice |
| 901 | -- | 930 | 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 |
| 931 | -- | 975 | Ayumi Igarashi 0001, William S. Zwicker. Fair division of graphs and of tangled cakes |