Tamás Fleiner

András Frank

Tamás Király

CoRR, 2024

2023

Complexity of stability in trading networks.

[BibT_eX]

[DOI]

Int. J. Game Theory, September, 2023

2021

Matching Under Preferences: Theory and Practice (Dagstuhl Seminar 21301).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2021

The Core of Housing Markets from an Agent's Perspective: Is It Worth Sprucing Up Your Home?

[BibT_eX]

[DOI]

Ildikó Schlotter

Proceedings of the Web and Internet Economics - 17th International Conference, 2021

2019

Pareto optimal coalitions of fixed size.

[BibT_eX]

[DOI]

Ágnes Cseh

Petra Harján

CoRR, 2019

2018

A Note on Restricted List Edge-Colourings.

[BibT_eX]

[DOI]

Comb., 2018

Trading Networks with Bilateral Contracts.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 14th International Conference, 2018

Trading Networks with Frictions.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

The Complexity of Cake Cutting with Unequal Shares.

[BibT_eX]

[DOI]

Ágnes Cseh

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

2017

Pareto optimal matchings with lower quotas.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2017

On the core and nucleolus of directed acyclic graph games.

[BibT_eX]

[DOI]

Balázs R. Sziklai

Tamás Solymosi

Math. Program., 2017

Stable Matching with Uncertain Pairwise Preferences.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Possible and Necessary Allocations Under Serial Dictatorship with Incomplete Preference Lists.

[BibT_eX]

[DOI]

Ildikó Schlotter

Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

2016

Stable matchings of teachers to schools.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

On Weighted Kernels of Two Posets.

[BibT_eX]

[DOI]

Zsuzsanna Jankó

Order, 2016

Coloring signed graphs using DFS.

[BibT_eX]

[DOI]

Gábor Wiener

Optim. Lett., 2016

Fractional solutions for capacitated NTU-games, with applications to stable matchings.

[BibT_eX]

[DOI]

Discret. Optim., 2016

House-swapping with divorcing and engaged pairs.

[BibT_eX]

[DOI]

Zsuzsanna Jankó

Discret. Appl. Math., 2016

Matching couples with Scarf's algorithm.

[BibT_eX]

[DOI]

Robert W. Irving

Ann. Math. Artif. Intell., 2016

2015

Modelling practical placement of trainee teachers to schools.

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., 2015

Pareto Optimal Matchings in Many-to-Many Markets with Ties.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

2014

Assigning evaluators to research grant applications: the case of Slovak Research and Development Agency.

[BibT_eX]

[DOI]

Eva Potpinková

Scientometrics, 2014

Pareto optimality in many-to-many matching problems.

[BibT_eX]

[DOI]

Discret. Optim., 2014

Choice Function-Based Two-Sided Markets: Stability, Lattice Property, Path Independence and Algorithms.

[BibT_eX]

[DOI]

Zsuzsanna Jankó

Algorithms, 2014

2012

The nucleolus of the bankruptcy Problem by Hydraulic rationing.

[BibT_eX]

[DOI]

Balázs R. Sziklai

IGTR, 2012

A matroid approach to stable matchings with lower quotas.

[BibT_eX]

[DOI]

Naoyuki Kamiyama

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

An algorithm for a super-stable roommates problem.

[BibT_eX]

[DOI]

Robert W. Irving

David F. Manlove

Theor. Comput. Sci., 2011

Optimization of an SMD placement machine and flows in parametric networks.

[BibT_eX]

[DOI]

Kybernetika, 2011

2010

The College Admissions problem with lower and common quotas.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Balanced list edge-colourings of bipartite graphs.

[BibT_eX]

[DOI]

András Frank

Electron. Notes Discret. Math., 2010

The integral stable allocation problem on graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2010

Housing Markets Through Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2010

On Stable Matchings and Flows.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

2008

The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems.

[BibT_eX]

[DOI]

Int. J. Game Theory, 2008

The Stable Roommates Problem with Choice Functions.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007

Efficient algorithms for generalized Stable Marriage and Roommates problems.

[BibT_eX]

[DOI]

Robert W. Irving

David F. Manlove

Theor. Comput. Sci., 2007

2005

On a generalization of the stable roommates problem.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2005

2004

A constrained independent set problem for matroids.

[BibT_eX]

[DOI]

András Frank

Satoru Iwata

Oper. Res. Lett., 2004

2003

On the stable b-matching polytope.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2003

A Fixed-Point Approach to Stable Matchings and Some Applications.

[BibT_eX]

[DOI]

Math. Oper. Res., 2003

2002

On a Lemma of Scarf.

[BibT_eX]

[DOI]

Ron Aharoni

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

2001

The Size of 3-Cross-Free Families.

[BibT_eX]

[DOI]

Comb., 2001

Note - Uncrossing a Family of Set-Pairs.

[BibT_eX]

[DOI]

Comb., 2001

A Matroid Generalization of the Stable Matching Polytope.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

2000

Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes.

[BibT_eX]

[DOI]

Volker Kaibel

Günter Rote

Eur. J. Comb., 2000

1999

Coverings and structure of crossing families.

[BibT_eX]

[DOI]

Tibor Jordán

Math. Program., 1999

Cycle Bases for Lattices of Binary Matroids with No Fano Dual Minor and Their One-Element Extensions.

[BibT_eX]

[DOI]

Winfried Hochstättler

Monique Laurent

Martin Loebl

J. Comb. Theory B, 1999

1997

Covering a Symmetric Poset by Symmetric Chains.

[BibT_eX]

[DOI]