394 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- HUN-REN Institute for Computer Science and ControlHU69 papers
- Hungarian Academy of SciencesHU32 papers
- ELTE Centre for Economic and Regional StudiesHU20 papers
- Budapest University of Technology and EconomicsHU14 papers
- Eötvös Loránd UniversityHU12 papers
- HUN-REN Wigner Research Centre for PhysicsHU11 papers
- Institute of EconomicsRU9 papers
- University College LondonGB9 papers
- Hungarian Research NetworkHU7 papers
- Complexity Science HubAT6 papers
- Institut de Recherche en Informatique de ToulouseFR6 papers
- Université Toulouse-I-CapitoleFR6 papers
13 papers · 1 filter
Multiple summation inequalities and their application to stability analysis of discrete-time delay systems
Eva Gyurkovics, Krisztina Kiss, Ilona Nagy +1
This paper is devoted to stability analysis of discrete-time delay systems based on a set of Lyapunov-Krasovskii functionals. New multiple summation inequalities are derived that i…
Portfolio Optimization under Expected Shortfall: Contour Maps of Estimation Error
Fabio Caccioli, Imre Kondor, Gábor Papp
The contour maps of the error of historical resp. parametric estimates for large random portfolios optimized under the risk measure Expected Shortfall (ES) are constructed. Similar…
Monotonicity and Competitive Equilibrium in Cake-cutting
Erel Segal-Halevi, Balázs Sziklai
We study the monotonicity properties of solutions in the classic problem of fair cake-cutting --- dividing a heterogeneous resource among agents with different preferences. Resourc…
A graph interpretation of the least squares ranking method
László Csató
The paper aims at analyzing the least squares ranking method for generalized tournaments with possible missing and multiple paired comparisons. The bilateral relationships may refl…
Ranking by pairwise comparisons for Swiss-system tournaments
László Csató
Pairwise comparison matrices are widely used in Multicriteria Decision Making. This article applies incomplete pairwise comparison matrices in the area of sport tournaments, namely…
Incomplete pairwise comparison matrices and weighting methods
László Csató, Lajos Rónyai
A special class of preferences, given by a directed acyclic graph, is considered. They are represented by incomplete pairwise comparison matrices as only partial information is ava…
Popular Edges and Dominant Matchings
Agnes Cseh, Telikepalli Kavitha
Given a bipartite graph G = (A u B, E) with strict preference lists and and edge e*, we ask if there exists a popular matching in G that contains the edge e*. We call this the popu…
The Stable Fixtures Problem with Payments
Péter Biró, Walter Kern, Daniël Paulusma +1
We generalize two well-known game-theoretic models by introducing multiple partners matching games, defined by a graph , with an integer vertex capacity function and a…
On the ranking of a Swiss system chess team tournament
László Csató
The paper suggests a family of paired comparison-based scoring procedures for ranking the participants of a Swiss system chess team tournament. We present the challenges of ranking…
Measuring centrality by a generalization of degree
László Csató
Network analysis has emerged as a key technique in communication studies, economics, geography, history and sociology, among others. A fundamental issue is how to identify key node…
Between plurality and proportionality: an analysis of vote transfer systems
László Csató
The paper considers a general model of electoral systems combining district-based elections with a compensatory mechanism in order to create any outcome between strictly majoritari…
Distance-based accessibility indices
László Csató
The paper attempts to develop a suitable accessibility index for networks where each link has a value such that a smaller number is preferred like distance, cost, or travel time. A…
Efficiency analysis of simple perturbed pairwise comparison matrices
Kristóf Ábele-Nagy, Sándor Bozóki
Efficiency, the basic concept of multi-objective optimization is investigated for the class of pairwise comparison matrices. A weight vector is called efficient if no alternative w…