On two competing mechanisms for priority-based allocation problems

We consider the priority-based allocation problem: there is a set of indivisible objects with multiple supplies (e.g., schools with seats) and a set of agents (e.g., students) with priorities over objects (e.g., proximity of residence area). We study two well-known and competing mechanisms. The agent-optimal stable mechanism (AOSM) allots objects via the deferred acceptance algorithm. The top trading cycles mechanism (TTCM) allots objects via Gale's top trading cycles algorithm. We show that the two mechanisms are equivalent, or TTCM is fair (i.e., respects agents’ priorities), or resource monotonic, or population monotonic, if and only if the priority structure is acyclic. Furthermore, if AOSM fails to be efficient (consistent) for a problem, TTCM also fails to be fair (consistent) for it. However, the converse is not necessarily true.     

Bundling as an optimal selling mechanism for a multiple-good monopolist

Multiple objects may be sold by posting a schedule consisting of one price for each possible bundle and permitting the buyer to select the price-bundle pair of his choice. We identify conditions that must be satisfied by any price schedule that maximizes revenue within the class of all such schedules. We then provide conditions under which a price schedule maximizes expected revenue within the class of all incentive compatible and individually rational mechanisms in the n-object case. We use these results to characterize environments, mainly distributions of valuations, where bundling is the optimal mechanism in the two and three good cases.     

Selling options

Contracts often take the form of options: oil fields can be abandoned, planning permission may go unused, and acquired firms can be liquidated. We consider a seller who auctions a dynamic option among N agents. After the auction, the economy evolves and the winning bidder chooses both if and when to execute the option. The revenue-maximising auction consists of an up-front bid and a contingent fee, where the latter is chosen in a Pigouvian manner, so the winning agent's choice of exercise time maximises the seller's revenue. This contingent payment is time- and state-invariant, so the seller does not have to observe post-auction information in order to implement the optimal auction. The revenue-maximising mechanism induces a dynamic distortion: the option is exercised later than under the comparable welfare-maximising mechanism.     

A solution to the hold-up problem involving gradual investment

We consider a setting in which the buyer's ability to hold up a seller's investment is so severe that there is no investment in equilibrium of the static game typically analyzed. We show that there exists an equilibrium of a related dynamic game generating positive investment. The seller makes a sequence of gradually smaller investments, each repaid by the buyer under the threat of losing further seller investment. As modeled frictions converge to zero, the equilibrium outcome converges to the first best. We draw connections between our work and the growing literature on gradualism in public good contribution games and bargaining games.     

Mixed bundling auctions

We study multi-object auctions where agents have private and additive valuations for heterogeneous objects. We focus on the revenue properties of a class of dominant strategy mechanisms where a weight is assigned to each partition of objects. The weights influence the probability with which partitions are chosen in the mechanism. This class contains efficient auctions, pure bundling auctions, mixed bundling auctions, auctions with reserve prices and auctions with pre-packaged bundles. For any number of objects and bidders, both the pure bundling auction and separate, efficient auctions for the single objects are revenue-inferior to an auction that involves mixed bundling.     

Optimal search auctions

We study the design of profit maximizing single unit auctions under the assumption that the seller needs to incur costs to contact prospective bidders and inform them about the auction. With independent bidders’ types and possibly interdependent valuations, the seller's problem can be reduced to a search problem in which the surplus is measured in terms of virtual utilities minus search costs. Compared to the socially efficient mechanism, the optimal mechanism features fewer participants, longer search conditional on the same set of participants, and inefficient sequence of entry.     

Surplus extraction with rich type spaces

We characterize revenue maximizing mechanisms in auction settings with ‘rich’ type spaces, where bidders obtain information from sources other than their own valuation. By considering a relaxed problem, we provide an upper bound on revenue extraction that explicitly builds on the richness of the information structure. We provide a condition under which this upper bound is achieved and describe an optimal mechanism. Under this condition, we also show that the optimal revenue can be achieved through dominant strategy implementation.     

Auctions with variable supply: Uniform price versus discriminatory

We examine an auction in which the seller determines the supply after observing the bids. We compare the uniform price and the discriminatory auction in a setting of supply uncertainty, where uncertainty is caused by the interplay of two factors: the seller's private information about marginal cost and the seller's incentive to sell the profit-maximizing quantity, given the received bids. In every symmetric mixed strategy equilibrium, bidders submit higher bids in the uniform price auction than in the discriminatory auction. In the two-bidder case, this result extends to the set of rationalizable strategies. As a consequence, we find that the uniform price auction generates a higher expected revenue for the seller and a higher trade volume.     

Treasury auctions in Spain: a linear approach

Abstract. The majority of Treasuries use discriminatory auctions to sell government debt. A few Treasuries use uniform auctions. The Spanish Treasury is the only one that uses a hybrid format of discriminatory and uniform auctions. All Treasury auctions are multiple-unit multiple-bid auctions, usually assumed to be common and unknown value auctions. Taking in account these features, we analyze the Spanish auction format, taking a linear approximation to bidders' multiple bids, and characterize a parameter set in which the Spanish format gives higher expected seller's revenue than discriminatory and uniform auctions. Policy implications are obtained by calibrating theoretical results with data. We thank S. Nu?ez, and seminar participants at GREQAM, CEFI, the 1999 CEF meeting in Boston and the 57th European Meeting of the Econcometric Society for suggestions. We are especially grateful to two anonymous referees for detailed comments that greatly improved the paper. Any error is our responsability. The authors express their thanks for financial support to Ministerio de Ciencia y Teconologia from Proyecto SEC2000-0723, n_o 9114.     

市场势力、资产专用性与企业研发投入:来自卖方与买方双维度考量的实证研究

在纵向关联市场中,市场势力和资产专用性是企业创新研发投入的重要影响因素。基于2012-2016年我国121家医药制造业上市公司微观数据,从买方与卖方双重视角探究市场势力、资产专用性与企业创新研发投入的关系。结果表明：买方势力、卖方势力与企业研发投入之间均呈现“倒U型”关系,即当买卖双方市场势力较小时,市场势力对企业研发投入的正向“激励效应”占主导地位;在市场势力超过一定水平后,市场势力对企业研发投入的负向“挤出效应”占主导地位,且相比于专用性资产投资强度较低的医药企业而言,卖方势力与买方势力对具有高资产专用性强度的医药企业研发投入所产生的“倒U型”影响更为显著。     

On the failure of the linkage principle with financially constrained bidders

This paper provides a class of examples of two-bidder common value second price auctions in which bidders may be financially constrained and the seller has access to information about the common value. We show that the seller's expected revenue under a revelation policy may be lower than that under a concealing policy. The intuition for the failure of the linkage principle is as follows. In the presence of financial constraints, the bidders’ upward response in their bids to the seller's good signals is limited by their financial constraints, while their downward response to bad signals is not.     

When less is more: Rationing and rent dissipation in stochastic contests

This paper shows how to maximize revenue when a contest is noisy. We consider a case where two or more contestants bid for a prize in a stochastic contest where all bidders value the prize equally. We show that, whenever a Tullock contest yields under-dissipation, the auctioneer?s revenue can be increased by optimally fixing the number of tickets. In particular, in a stochastic contest with proportional probabilities, it is possible to obtain (almost) full rent dissipation. We test this hypothesis with a laboratory experiment. The results indicate that, as predicted, revenue is significantly higher in a lottery with rationing than in a standard lottery. On the other hand, an alternative rationing mechanism that does not limit total expenditures fails to increase revenue relative to a standard lottery.     

Pricing, learning, and strategic behavior in a single-sale model

Summary. We analyze an infinite horizon model where a seller who owns an indivisible unit of a good for sale has incomplete information about the state of the world that determines not only the demand she faces but also her own valuation for the good. Over time, she randomly meets potential buyers who may have incentives to manipulate her learning process strategically. We show that i) the seller's incentives to post a high price and to experiment are not necessarily monotonic in the information conveyed by a buyer's rejection; and ii) as the discount factors tend to one, there are equilibria where the seller always ends up selling the good at an ex-post individually rational price. Received: January 6, 1999; revised version: July 15, 2000     

Voting by committees under constraints

We consider social choice problems where a society must choose a subset from a set of objects. Specifically, we characterize the families of strategy-proof voting procedures when not all possible subsets of objects are feasible, and voters’ preferences are separable or additively representable.     

Extending the Nash solution to choice problems with reference points

In 1985 Aumann axiomatized the Shapley NTU value by non-emptiness, efficiency, unanimity, scale covariance, conditional additivity, and independence of irrelevant alternatives. We show that, when replacing unanimity by “unanimity for the grand coalition” and translation covariance, these axioms characterize the Nash solution on the class of n-person choice problems with reference points. A classical bargaining problem consists of a convex feasible set that contains the disagreement point here called reference point. The feasible set of a choice problem does not necessarily contain the reference point and may not be convex. However, we assume that it satisfies some standard properties. Our result is robust so that the characterization is still valid for many subclasses of choice problems, among those is the class of classical bargaining problems. Moreover, we show that each of the employed axioms – including independence of irrelevant alternatives – may be logically independent of the remaining axioms.     

旅游温冷区国内旅游市场营销研究

我国旅游业已由卖方市场走向买方市场,对旅游市场的规律和开拓研究就变的愈发重要。本文以云南省玉溪市为例,对中国旅游温冷地区的旅游者行为、目标市场细分进行了分析研究,认为旅游温冷地区的旅游者主要为周末旅游,表现为游客时间分布上的明显周期性峰值;其次,旅游者分布具有空间近距离性,且旅游客源地集中度经较高;第三,旅游者具有大众性,即旅游产品、项目策划和营销应面向大众。在此基础上,提出了旅游营销拉动发展模式以及针对性的市场营销扩展策略。     

The value of an informed bidder in common value auctions

I compare two information structures in a common value first-price auction with two bidders: In one, each of the two bidders knows only his own signal about the value of the object, and in the other, one of the bidders learns his opponent's signal as well. Gaining the additional information in the second information structure makes the informed bidder worse off if the value is submodular in the bidders' signals and better off if it is supermodular. If the value is supermodular, then the seller's revenue tends to be lower with the informed bidder than without.     

On ascending Vickrey auctions for heterogeneous objects

We construct an ascending auction for heterogeneous objects by applying a primal-dual algorithm to a linear program that represents the efficient-allocation problem for this setting. The auction assigns personalized prices to bundles, and asks bidders to report their preferred bundles in each round. A bidder's prices are increased when he belongs to a “minimally undersupplied” set of bidders. This concept generalizes the notion of “overdemanded” sets of objects introduced by Demange, Gale, and Sotomayor for the one-to-one assignment problem. Under a submodularity condition, the auction implements the Vickrey-Clarke-Groves outcome; we show that this type of condition is somewhat necessary to do so. When classifying the ascending-auction literature in terms of their underlying algorithms, our auction fills a gap in that literature. We relate our results to various ascending auctions in the literature.     

Pairwise kidney exchange: Comment

In their recent paper, Roth et al. [Pairwise kidney exchange, J. Econ. Theory 125 (2005) 151-188] consider pairwise kidney exchanges, and show within this subset of feasible exchanges that a priority mechanism is strategy-proof. We show that this result can be broadened to allow much more general mechanisms and restrictions on the feasible set of allocations, including allowing three-way exchanges, regional specifications, and others. The key requirement is that the choice mechanism be consistent, i.e., if an allocation is chosen from some set of feasible allocations, it is also chosen from any subset of that set.     

Strategy-proof assignment on the full preference domain

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.