905 resultados para taylor rules
Resumo:
Attention to transferable skills is growing in higher education. Problem-based learning (PBL) is increasingly used in management education for its promising potential to, amongst others, promote transferable skills, including problem-solving, critical thinking and teamwork skills. However, this relationship is seldom assessed. In this study, I use structural equation modelling to examine the effectiveness of PBL, measured through students’ perceptions of satisfaction and skills development. Results show the development of transferable skills is explained by interaction with tutors and a host company, and defining teamwork rules. Satisfaction is explained by skills development, assessment issues, defining teamwork rules and understanding how organisations work. I draw conclusions and recommendations.
Resumo:
Many democratic decision making institutions involve quorum rules. Such rules are commonly motivated by concerns about the “legitimacy” or “representativeness” of decisions reached when only a subset of eligible voters participates. A prominent example of this can be found in the context of direct democracy mechanisms, such as referenda and initiatives. We conduct a laboratory experiment to investigate the consequences of the two most common types of quorum rules: a participation quorum and an approval quorum. We find that both types of quora lead to lower participation rates, dramatically increasing the likelihood of full-fledged electoral boycotts on the part of those who endorse the Status Quo. This discouraging effect is significantly larger under a participation quorum than under an approval quorum.
Resumo:
Mestrado em Finanças
Resumo:
Fuzzy classification, semi-supervised learning, data mining
Resumo:
v.20:no.10(1935)
Resumo:
no.4 (1975)
Resumo:
In this paper, we study individual incentives to report preferences truthfully for the special case when individuals have dichotomous preferences on the set of alternatives and preferences are aggregated in form of scoring rules. In particular, we show that (a) the Borda Count coincides with Approval Voting on the dichotomous preference domain, (b) the Borda Count is the only strategy-proof scoring rule on the dichotomous preference domain, and (c) if at least three individuals participate in the election, then the dichotomous preference domain is the unique maximal rich domain under which the Borda Count is strategy-proof.
Resumo:
Constitutional arrangements affect the decisions made by a society. We study how this effect leads to preferences of citizens over constitutions; and ultimately how this has a feedback that determines which constitutions can survive in a given society. Constitutions are stylized here, to consist of a voting rule for ordinary business and possibly different voting rule for making changes to the constitution. We deffine an equilibrium notion for constitutions, called self-stability, whereby under the rules of a self-stable constitution, the society would not vote to change the constitution. We argue that only self-stable constitutions will endure. We prove that self-stable constitutions always exist, but that most constitutions (even very prominent ones) may not be self-stable for some societies. We show that constitutions where the voting rule used to amend the constitution is the same as the voting rule used for ordinary business are dangerously simplistic, and there are (many) societies for which no such constitution is self-stable rule. We conclude with a characterization of the set of self-stable constitutions that use majority rule for ordinary business.
Resumo:
The division problem consists of allocating an amount of a perfectly divisible good among a group of n agents with single-peaked preferences. A rule maps preference profiles into n shares of the amount to be allocated. A rule is bribe-proof if no group of agents can compensate another agent to misrepresent his preference and, after an appropriate redistribution of their shares, each obtain a strictly preferred share. We characterize all bribe-proof rules as the class of efficient, strategy-proof, and weak replacement monotonic rules. In addition, we identify the functional form of all bribe-proof and tops-only rules.
Resumo:
We study the assignment of indivisible objects with quotas (houses, jobs, or offices) to a set of agents (students, job applicants, or professors). Each agent receives at most one object and monetary compensations are not possible. We characterize efficient priority rules by efficiency, strategy-proofness, and renegotiation-proofness. Such a rule respects an acyclical priority structure and the allocations can be determined using the deferred acceptance algorithm.
Resumo:
We consider the following allocation problem: A fixed number of public facilities must be located on a line. Society is composed of $N$ agents, who must be allocated to one and only one of these facilities. Agents have single peaked preferences over the possible location of the facilities they are assigned to, and do not care about the location of the rest of facilities. There is no congestion. In this context, we observe that if a public decision is a Condorcet winner, then it satisfies nice properties of internal and external stability. Though in many contexts and for some preference profiles there may be no Condorcet winners, we study the extent to which stability can be made compatible with the requirement of choosing Condorcet winners whenever they exist.