Simplified group activity selection with group size constraints
From MaRDI portal
Publication:2121462
DOI10.1007/s00182-021-00789-7zbMath1484.91169OpenAlexW3200172102MaRDI QIDQ2121462
Sebastian Schneckenburger, Janosch Döcker, Britta Dorn, Andreas Darmann
Publication date: 4 April 2022
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00182-021-00789-7
Applications of game theory (91A80) Social choice (91B14) Mathematical economics and fuzziness (91B86)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Group activity selection on graphs: parameterized analysis
- The college admissions problem with lower and common quotas
- Clustering to minimize the maximum intercluster distance
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
- Group activity selection problem with approval preferences
- A social choice approach to ordinal group activity selection
- Matchings with lower quotas: algorithms and complexity
- Stable and Pareto optimal group activity selection from ordinal preferences
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Assigning papers to referees
- Envy-free matchings with lower quotas
- On simplified group activity selection
- Strategy-proof school choice mechanisms with minimum quotas and initial endowments
- Pareto optimal matchings with lower quotas
- Matching with quorums
- A note on the serial dictatorship with project closures
- A fine-grained view on stable many-to-one matching problems with lower and upper quotas
- Generalized planar matching
- Efficient algorithms for finding maximum matching in graphs
- Hedonic Games
- On the completeness of a generalized matching problem
- Combinatorial optimization. Theory and algorithms.
- College Admissions and the Stability of Marriage
This page was built for publication: Simplified group activity selection with group size constraints
