Suchergebnisse

We consider situations where a society allocates a finite units of an indivisible good among agents, and each agent receives at most one unit of the good. For example, imagine that a government allocates a fixed number of licences to private firms, or imagine that a government distributes equally divided lands to households. We show that the Vickrey allocation rule is the unique allocation rule satisfying strategy-proofness, anonymity and individual rationality.

We consider the problem of allocating objects to a group of agents and how much agents should pay. Each agent receives at most one object and has non-quasi-linear preferences. Non-quasi-linear preferences describe environments where payments influence agents' abilities to utilize objects or derive benefits from them. The ``minimum price Walrasian (MPW) rule'' is the rule that assigns a minimum price Walrasian equilibrium allocation to each preference profile. We establish that the MPW rule is the unique rule satisfying \textit{strategy-proofness}, \textit{efficiency}, \textit{individual rationality}, and \textit{no subsidy for losers}. Since the outcome of the MPW rule coincides with that of the simultaneous ascending (SA) auction, our result supports SA auctions adopted by many governments.

We consider the problems of allocating several heterogeneous objects owned by governments to a group of agents and how much agents should pay. Each agent receives at most one object and has nonquasi-linear preferences. Nonquasi-linear preferences describe environments in which large-scale payments influence agents' abilities to utilize objects or derive benefits from them. The minimum price Walrasian (MPW) rule is the rule that assigns a minimum price Walrasian equilibrium allocation to each preference profile. We establish that the MPW rule is the unique rule that satisfies the desirable properties of strategy-proofness, Pareto-efficiency, individual rationality, and nonnegative payment on the domain that includes nonquasi-linear preferences. This result does not only recommend the MPW rule based on those desirable properties, but also suggest that governments cannot improve upon the MPW rule once they consider them essential. Since the outcome of the MPW rule coincides with that of the simultaneous ascending (SA) auction, our result explains the pervasive use of the SA auction.

We consider the problem of allocating finitely many units of an indivisible good among a group of agents when each agent receives at most one unit of the good and pays a non-negative price. For example, imagine that a government allocates a fixed number of licenses to private firms, or that it distributes equally divided lands to households. Anonymity in welfare is a condition of impartiality in the sense that it requires allocation rules to treat agents equally in welfare terms from the viewpoint of agents who are ignorant of their own valuations or identities. We show that the Vickrey allocation rule is the unique allocation rule satisfying strategy-proofness, anonymity in welfare, and individual rationality.

This paper studies the possibility of strategy-proof rules yielding satisfactory solutions to matching problems. Alcalde and Barberá (1994) show that effcient and individually rational matching rules are manipulable in the one-to-one matching model. We pursue the possibility of strategy-proof matching rules by relaxing effciency to the weaker condition of respect for unanimity. Our first result is positive. We prove that a strategy-proof rule exists that is individually rational and respects unanimity. However, this rule is unreasonable in the sense that a pair of agents who are the best for each other are matched on only rare occasions. In order to explore the possibility of better matching rules, we introduce the natural condition of 'respect for pairwise unanimity.' Respect for pairwise unanimity states that a pair of agents who are the best for each other should be matched, and an agent wishing to stay single should stay single. Our second result is negative. We prove that no strategy-proof rule exists that respects pairwise unanimity. This result implies Roth (1982) showing that stable rules are manipulable. We then extend this to the many-to-one matching model.

We consider situations where a society tries to efficiently allocate several homogeneous and indivisible goods among agents. Each agent receives at most one unit of the good. For example, suppose that a government wishes to allocate a fixed number of licenses to operate in its country to private companies with highest abilities to utilize the licenses. Usually companies with higher abilities can make more profits by licenses and are willing to pay higher prices for them. Thus, auction mechanisms are often employed to extract the information on companies' abilities and to allocate licenses efficiently. However, if prices are too high, they may damage companies' abilities to operate. Generally high prices may change the benefits agents obtain from the goods unless agents' preferences are quasi-linear, and we call it 'income effect'. In this paper, we establish that on domains including nonquasi-linear preferences, that is, preferences exhibiting income effect, an allocation rule which satisfies Pareto-efficiency, strategy-proofness, individual rationality, and nonnegative payment uniquely exists and it is the Vickrey allocation rule.

We consider the problem of allocating infinitely divisible commodities among a group of agents. Especially, we focus on the case where there are several commodities to be allocated, and agents have continuous, strictly convex, and separable preferences. In this paper, we establish that the uniform rule is the only rule satisfying strategy-proofness, unanimity, symmetry, and nonbossiness.

Several Japanese local governments started to add endogenous minimum prices to firstprice auctions in their public procurements. Any bid less than the endogenous minimum price is referred to as abnormally low and is excluded from the procurement procedure. The endogenous minimum price is generally calculated as 80% to 90% of the average of some of the lowest bids or all bids. Therefore, producers who join this new institution have incentives to raise their bids and pull the endogenous minimum price to exclude others. We experimentally evaluate the performance of this new institution relative to the standard first-price auction which do not have any minimum price. We find that winning prices of this new institution (i) coincide with the ones of the standard first-price auction and are close to the production cost under our identical cost condition, and (ii) are higher than the ones of the standard first-price auction and diverge from the lowest production cost under our different cost condition when subjects' identifications and all their bids are revealed.