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