Showing 1 - 10 of 4,587
"This paper will introduce new methods to estimate the two-way fixed effects model and the match effects model in datasets where the number of fixed effects makes standard estimation techniques infeasible. The methods work for balanced and unbalanced panels and increase the speed of estimation...
Persistent link: https://www.econbiz.de/10010963717
Taking as a starting point the theory of matching applied in the case of a problem of college admissions, where one is … students and colleges, in order to achieve the best possible matching that is stable, strategy-proof, Pareto efficient and fair. …
Persistent link: https://www.econbiz.de/10009393785
, such as the exploration of stable solutions for matching and exchange, the measurement of power and a deeper understanding …
Persistent link: https://www.econbiz.de/10011141073
Roth is the major force in creating a vibrant field of matching theory and its application to market design. In doing … so, he has discovered many properties of the stable matching problem (especially from the strategic viewpoint of game …
Persistent link: https://www.econbiz.de/10010861117
В статье рассматриваются оптимальные институциональные стратегии поведения социальных агентов в условиях игровой неопределенности, существующей в моделях...
Persistent link: https://www.econbiz.de/10011228345
Persistent link: https://www.econbiz.de/10005048575
A matching and bargaining model in a market with one seller and two buyers, differing only in their reservation price …
Persistent link: https://www.econbiz.de/10005749740
We describe a new dual algorithm for the minimum cost flow problem. It can be regarded as a variation of the best known … strongly polynomial minimum cost flow algorithm, due to Orlin. Indeed we obtain the same running time of O(m log m(m+n log n …)), where n and m denote the number of vertices and the number of edges. However, in contrast to Orlin's algorithm we work …
Persistent link: https://www.econbiz.de/10010847877
LetM <Subscript>1</Subscript> andM <Subscript>2</Subscript> be matroids onS,B be theirk-element common independent set, andw a weight function onS. Given two functionsb ≥ 0 andc ≥ 0 onS, the Inverse Matroid Intersection Problem (IMIP) is to determine a modified weight functionw′ such that (a)B becomes a maximum weight common...</subscript></subscript>
Persistent link: https://www.econbiz.de/10010999857
Given a networkN=(V,A,c), a sources εV, a. sinkt εV and somes —t cuts and suppose each element of the capacity vectorc can be changed with a cost proportional to the changes, the inverse problem of minimum cuts we study here is to change the original capacities with the least total cost...
Persistent link: https://www.econbiz.de/10010999880