In a two-sided matching market when agents on both sides have preferences the stability of the solution is typically the most important requirement. However, we may also face some distributional constraints with regard to the minimum number of assignees or the distribution of the assignees...

Bónusz-málusz rendszerek kockázatkezelési módszerek, amelyek leggyakoribb előfordulása a kötelező gépjármű-felelősségbiztosítás esetén figyelhető meg. Bónusz-málusz rendszerek kalibrációja jellemzően abban merül ki, hogy egy adott átsorolási szabályt feltételezve...

Pairwise comparison matrices are increasingly used in settings where some pairs are missing. However, there exist few inconsistency indices for similar incomplete data sets and no reasonable measure has an associated threshold. This paper generalises the famous rule of thumb for the acceptable...

Safety is paramount in the construction industry and the fixed sprinkler and water spray systems used in firefighting involve networks of pipes of various lengths. Manufacturers of such fixed firefighting systems need to either cut the existing stocks to length—a (one-dimensional)...

A cikkben bemutatunk egy módszert országok (vagy egyéb kockázatközösségek) halandósági mintázataik alapján történő csoportosítására (klaszterezésére). A bemutatandó módszer a görbék klaszterezésén alapul, ami viszonylag új területnek számít az adatelemzésben. A...

We consider the two-sided stable matching setting in which there may be uncertainty about the agents’ preferences due to limited information or communication. We consider three models of uncertainty: (1) lottery model—for each agent, there is a probability distribution over linear...

We study strong core and Pareto-optimal solutions for multiple partners matching problem under lexicographic preference domains from a computational point of view. The restriction to the two-sided case is called stable many-to-many matching problem and the general one-sided case is called stable...

We introduce a new two-sided stable matching problem that describes the summer internship matching practice of an Australian university. The model is a case between two models of Kamada and Kojima on matchings with distributional constraints. We study three solution concepts, the strong and weak...