We propose a discrete time probabilistic model of depositor behavior which takes into account the information flow among depositors. In each time period each depositors' current state is determined in a stochastic way, based on its previous state, the state of other connected depositors and the...

We develop Integer Programming (IP) solutions for some special college admission problems arising from the Hungarian higher education admission scheme. We focus on four special features, namely the solution concept of stable score-limits, the presence of lower and common quotas, and paired...

We compare four methodologies to estimate the global distribution of income and find that many methods work well, but the method based on two-parameter distributions is more accurate than other methods. This method is simpler, easier to implement and relies on a more internationally-comparable...

The so called classic model of tax compliance behaviour interprets the problem as an individual decision under risk made by a single taxpayer. After a concise description of this model our literature survey investigates whether the empirical results found in the literature corroborate the...

We are given a bipartite graph G = (A B;E) where each vertex has a preference list ranking its neighbors: in particular, every a A ranks its neighbors in a strict order of preference, whereas the preference list of any b B may contain ties. A matching M is popular if there is no matching M' such...

We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph G = (A P, E) with weights on the edges in E, and with lower and upper quotas on the vertices in P.We seek a maximum weight many-to-one matching satisfying two sets of...

Given a bipartite graph G=(A B, E) with strict preference lists and given an edge e E, we ask if there exists a popular matching in G that contains e. We call this the popular edge problem. A matching M is popular if there is no matching M' such that the vertices that prefer M' to M outnumber...

We consider two variants of the classical Stable Roommates problem with Incomplete (but strictly ordered) preference lists (SRI) that are degree constrained, i.e., preference lists are of bounded length. The first variant, egal d-SRI, involves finding an egalitarian stable matching in solvable...

Agent based models are proposed as an adequate tool for analysing tax payer decisions and, thereby, the consequences of such decisions as they manifest themselves at the macro level. TAXSIM models the conduct of agents of three types, i.e. employers, employees and the government, in an economy...

We generalize two well-known game-theoretic models by introducing multiple partners matching games, defined by a graph G = (N;E), with an integer vertex capacity function b and an edge weighting w. The set N consists of a number of players that are to form a set M is a subset of E of 2-player...