首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
    
Using lotteries is a common tool for allocating indivisible goods. Since obtaining preferences over lotteries is often difficult, real-life mechanisms usually rely on ordinal preferences over deterministic outcomes. Bogomolnaia and Moulin (J. Econom. Theory 19 (2002) 623) show that the outcome of an ex post efficient mechanism may be stochastically dominated. They define a random assignment to be ordinally efficient if and only if it is not stochastically dominated. In this paper we investigate the relation between ex post efficiency and ordinal efficiency. We introduce a new notion of domination defined over sets of assignments and show that a lottery induces an ordinally efficient random assignment if and only if each subset of the full support of the lottery is undominated.  相似文献   

2.
    
In this paper, we show that there is a relationship between two important matching mechanisms: the Top Trading Cycles mechanism (TTC mechanism proposed by Abdulkadiroglu and Sonmez, 1999) and the Top Trading Cycles and Chains mechanism (TTCC mechanism proposed by Roth, Sonmez, and Unver, 2004). Our main result is that when a specific chain selection rule proposed by Roth et al. is used, these two mechanisms are equivalent. While the equivalence is relevant for one specific case of the TTCC mechanism, it is a particularly interesting case since it is the only version identified by Roth et al. to be both Pareto-efficient and strategy-proof.  相似文献   

3.
    
We introduce the notion of group robust stability which requires robustness against a combined manipulation, first misreporting preferences and then rematching, by any group of students in the school choice type of matching markets. Our first result shows that there is no group robustly stable mechanism even under acyclic priority structures. Next, we define a weak version of group robust stability, called weak group robust stability. Our main theorem, then, proves that there is a weakly group robustly stable mechanism if and only if the priority structure of schools is acyclic, and in that case, it coincides with the student-optimal stable mechanism.  相似文献   

4.
We show how to restrict trades in exchange markets with heterogeneous indivisible goods so that the resulting restricted exchange markets, the fixed deal exchange markets, have a unique core allocation. Our results on fixed deal exchange markets generalize classical results on the Shapley-Scarf housing market, in which each agent owns one good only. Furthermore, we define the class of fixed deal exchange rules for general exchange markets, and prove that these are the only exchange rules that satisfy strategyproofness, individual rationality, and a weak form of efficiency.  相似文献   

5.
We introduce the framework of parameterized collections of games with and without sidepayments and provide three nonemptiness of approximate core theorems. The parameters bound (a) the number of approximate types of players and the size of the approximation and (b) the size of nearly effective groups of players and their distance from exact effectiveness. Our theorems are based on a new notion of partition-balanced profiles and approximately partition-balanced profiles. The results are applied to a new model of an economy with clubs. In contrast to the extant literature, our approach allows both widespread externalities and uniform results. A fundamental new mathematical result, the partition-balancing effect of large numbers, which promises to have further applications, is contained in Appendix A.  相似文献   

6.
Deliberative voting   总被引:1,自引:0,他引:1  
We analyze a model of jury decision making in which jurors deliberate before casting their votes. We consider a wide range of voting institutions and show that deliberations render these equivalent with respect to the sequential equilibrium outcomes they generate. In particular, in the context of a jury setup, all voting rules excluding the two types of unanimity rules (one requiring a unanimous consensus to acquit, one requiring a unanimous consensus to convict) induce the same set of equilibria outcomes. We show the robustness of our results with respect to several restrictions on communication protocols and jurors’ strategies. Furthermore, we demonstrate that our observations extend to practically all of the voting structures commonly studied in the voting literature. The paper suggests the importance of accounting for communication in models of collective choice.  相似文献   

7.
In production economies with unequal skills, this paper characterizes bargaining solutions by using axioms on allocation rules rather than axioms on classical bargaining solutions. We introduce a new axiom, consistency w.r.t. technological innovations, so that the non-welfaristic characterizations of bargaining solutions in the production economies are provided. By the characterizations, we can classify the three bargaining solutions (the Nash, the Kalai-Smorodinsky, and the Egalitarian solutions) from the viewpoint of responsibility and compensation discussed by Dworkin.  相似文献   

8.
Agents partition deterministic outcomes into good or bad. A mechanism selects a lottery over outcomes (time-shares). The probability of a good outcome is the canonical utility. The utilitarian mechanism averages over outcomes with largest “approval”. It is efficient, strategyproof, anonymous and neutral.We reach an impossibility if, in addition, each agent's utility is at least , where n is the number of agents; or is at least the fraction of good to feasible outcomes. We conjecture that no ex ante efficient and strategyproof mechanism guarantees a strictly positive utility to all agents, and prove a weaker statement.  相似文献   

9.
In this paper, virtual implementation is restricted to deliver, on the equilibrium path, either a socially optimal outcome or a status quo: an outcome fixed for all preference profiles. Under such a restriction, for any unanimous and implementable social choice function there is a dictator, who obtains her most preferable outcome as long as all agents prefer this outcome to the status quo. Further restrictions on the lottery space and the range of social choice functions allow the dictator to impose her most preferred outcome even when other agents prefer the status quo to this outcome.  相似文献   

10.
A simple mechanism is presented that allocates an indivisible object between two agents for almost any possible compensation rule. Furthermore, the equilibrium strategy guarantees a level of utility not less than −ε, where ε can be arbitrarily small.  相似文献   

11.
Bargaining one-dimensional social choices   总被引:1,自引:0,他引:1  
We analyze bargaining over the one-dimension characteristic of a public good among n impatient players when decisions require q favorable votes, q?2. Stationary subgame perfect equilibrium strategies are characterized for all games with deterministic protocol. We provide a monotonicity condition (satisfied by all single-peak, strictly quasi-concave and concave utilities) that assures uniqueness for every q whenever player's utilities are symmetric around the peak. Without symmetry, the monotonicity condition assures uniqueness for qualified majorities, q>n/2, provided that agents are sufficiently patient and utilities satisfy an additional regularity condition. Asymptotic uniqueness is assured for qualified majorities by imposing only the monotonicity condition.  相似文献   

12.
We investigate the adverse selection problem where a principal delegates multiple tasks to an agent. We characterize the virtually implementable social choice functions by using the linking mechanism proposed by Jackson and Sonnenschein (2007) [20] that restricts the message spaces. The principal does not require any incentive wage schemes and can therefore avoid any information rent and welfare loss. We show the resemblance between the functioning of this message space restriction and that of incentive wage schemes. We also extend the results of the single-agent model to the multi-agent model.  相似文献   

13.
Ostrovsky (2008) [9] develops a theory of stability for a model of matching in exogenously given networks. For this model a generalization of pairwise stability, chain stability, can always be satisfied as long as agents' preferences satisfy same side substitutability and cross side complementarity. Given this preference domain I analyze the interplay between properties of the network structure and (cooperative) solution concepts. The main structural condition is an acyclicity notion that rules out the implementation of trading cycles. It is shown that this condition and the restriction that no pair of agents can sign more than one contract with each other are jointly necessary and sufficient for (i) the equivalence of group and chain stability, (ii) the core stability of chain stable networks, (iii) the efficiency of chain stable networks, (iv) the existence of a group stable network, and (v) the existence of an efficient and individually stable network. These equivalences also provide a rationale for chain stability in the unrestricted model. The (more restrictive) conditions under which chain stability coincides with the core are also characterized.  相似文献   

14.
A new axiom, symmetry-based compromise, is introduced to study solutions to convex bargaining problems. It is shown that any efficient solution that is also scale invariant and satisfies symmetry-based compromise must be Nash.  相似文献   

15.
Stable schedule matching under revealed preference   总被引:2,自引:0,他引:2  
Baiou and Balinski (Math. Oper. Res., 27 (2002) 485) studied schedule matching where one determines the partnerships that form and how much time they spend together, under the assumption that each agent has a ranking on all potential partners. Here we study schedule matching under more general preferences that extend the substitutable preferences in Roth (Econometrica 52 (1984) 47) by an extension of the revealed preference approach in Alkan (Econom. Theory 19 (2002) 737). We give a generalization of the Gale-Shapley algorithm and show that some familiar properties of ordinary stable matchings continue to hold. Our main result is that, when preferences satisfy an additional property called size monotonicity, stable matchings are a lattice under the joint preferences of all agents on each side and have other interesting structural properties.  相似文献   

16.
We give a game-theoretic foundation for the median voter theorem in a one-dimensional bargaining model based on Baron and Ferejohn's [D. Baron, J. Ferejohn, Bargaining in legislatures, Amer. Polit. Sci. Rev. 83 (1989) 1181-1206] model of distributive politics. We prove that as the agents become arbitrarily patient, the set of proposals that can be passed in any pure strategy, subgame perfect equilibrium collapses to the median voter's ideal point. While we leave the possibility of some delay, we prove that the agents' equilibrium continuation payoffs converge to the utility from the median, so that delay, if it occurs, is inconsequential. We do not impose stationarity or any other refinements. Our result counters intuition based on the folk theorem for repeated games, and it contrasts with the known result for the distributive bargaining model that as agents become patient, any division of the dollar can be supported as a subgame perfect equilibrium outcome.  相似文献   

17.
There is a wide range of economic problems that involve the exchange of indivisible goods with no monetary transfers, starting from the housing market model of the seminal paper by Shapley and Scarf (1974) to problems such as the kidney exchange or the school choice problem. The classical solution to many of these models is to apply a mechanism called Top Trading Cycles, attributed to David Gale, which satisfies good properties for the case of strict preferences. In this paper, we propose a family of mechanisms, called Top Trading Absorbing Sets mechanisms, which generalize the Top Trading Cycles to the general case in which individuals are allowed to report indifferences, while preserving a maximal possible set of its desirable properties.  相似文献   

18.
This paper introduces a new concept of full implementation that takes into account agents’ preferences for understanding how the process concerning honest reporting works. We assume that the agents have intrinsic preferences for honesty in the sense that they dislike the idea of lying when it does not influence their welfare but instead goes against the intention of the central planner. We show that the presence of such preferences functions in eliminating unwanted equilibria from the practical perspective, even if the degree of the preference for honesty is small. The mechanisms designed are detail free and involve only small fines.  相似文献   

19.
    
We consider the problem of efficiently allocating several indivisible objects between agents who are to receive at most one object and whose preferences are private information. We examine this standard “assignment” problem from the perspective of mechanism design giving up the usual assumption of linear preferences and instead using a full preference domain (with indifferences permitted). We characterize two classes of mechanisms: (i) Bi-polar Serially Dictatorial Rules by Essential Single-Valuedness, Pareto Indifference, Strategy-Proofness and Non-Bossiness; and (ii) all selections from Bi-polar Serially Dictatorial Rules by Single-Valuedness, Efficiency, Strategy-Proofness and Weak Non-Bossiness. We compare the outcomes from the (Bi-polar) Serially Dictatorial Rules with the outcomes obtained using a market based approach, namely the “core” of the market. We show that all strongly efficient outcomes in the core can be generated using Serially Dictatorial Rules. Moreover, we argue that Serially Dictatorial Rules have an advantage over the market based approach in that they yield strongly efficient solutions for all preference profiles, making it possible to use randomization to restore equity. When preferences are private information, this type of ex ante equity cannot be implemented using the market based approach.  相似文献   

20.
This paper proposes a model of multilateral contracting where players are engaged in two parallel interactions: they dynamically form coalitions and play a repeated normal form game with temporary and permanent decisions. We show that when outside options are independent of the actions of other players all Markov perfect equilibrium without coordination failures are efficient, regardless of externalities created by interim actions. Otherwise, in the presence of externalities on outside options, all Markov perfect equilibrium may be inefficient. This formulation encompasses many economic models, and we analyze the distribution of coalitional gains and the dynamics of coalition formation in four illustrative applications.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号