An Axiomatic Analysis of Joint Liability Problems with Rooted Tree Structure
نویسندگان
چکیده
منابع مشابه
Constrained allocation problems with single-peaked preferences: An axiomatic analysis
We introduce a new class of problems that contains two existing classes: allocation problems with single-peaked preferences and bankruptcy problems. On this class, we analyze the implications of well-known properties such as Pareto optimality, strategy-proofness, resource-monotonicity, no-envy, equal treatment of equals, and two new properties we introduce, hierarchical no-envy and independence...
متن کاملKey Factors of Joint-liability Loan Contracts an Empirical Analysis
This paper provides an empirical analysis of joint-liability micro-lending contracts. Using our data set from Constanta (a Georgian micro-lender), we examine the efficacy of various incentives set by this contract such as joint-liability between groups of borrowers or group access to future and to larger loans. As proposed by theory, we find that joint liability induces a group formation where ...
متن کاملAn axiomatic approach in minimum cost spanning tree problems with groups
We study minimum cost spanning tree problems with groups, where agents are located in di¤erent villages, cities, etc. The groups are the agents of the same village. In Bergantiños and Gómez-Rúa (2010, Economic Theory) we de ne the rule F as the Owen value of the irreducible game with groups and we prove that F generalizes the folk rule of minimum cost spanning tree problems. Bergantiños and Vid...
متن کاملan infinite planar array of rectangular microstrip patch antenna analysis
the methods which are used to analyze microstrip antennas, are divited into three categories: empirical methods, semi-empirical methods and full-wave analysis. empirical and semi-empirical methods are generally based on some fundamental simplifying assumptions about quality of surface current distribution and substrate thickness. thses simplificatioms cause low accuracy in field evaluation. ful...
15 صفحه اولAn Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes
Several variations of rooted tree based solutions have been recently proposed for member revocation in multicast communications [18, 19, 20, 21]. In this paper, we show that by assigning probabilities for member revocations, the optimality, correctness, and the system requirements of some of these schemes [18, 19, 20, 21] can be systematically studied using information theoretic concepts. Speci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2016
ISSN: 1556-5068
DOI: 10.2139/ssrn.2787032