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.     

IPO股票上市初期投资者交易行为研究

区别于国内以股票价格为对象揭示IPO股票特征的研究,文章以投资者为研究对象,研究中国IPO股票上市初期机构和个人投资者的交易行为差异。IPO交易研究是目前IPO研究的一个前沿领域。文章利用沪深股市2002年IPO股票的账户交易数据建立Logistic回归模型发现,中国IPO股票上市首日的高成交量与高换手率由投资者逐利行为造成;在上市后3日的交易中,个人投资者由于资金限制和信息获取能力不足等原因,对股票收益的判断能力明显弱于机构投资者,在交易中被机构投资者所利用。     

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.     

Ascending price Vickrey auctions

We show that an ascending price auction for multiple units of a homogeneous object proposed by Ausubel (i) raises prices for packages until they reach those nonlinear and non-anonymous market clearing prices at which bidders get their marginal products and (ii) the auction is a primal–dual algorithm applied to an appropriate linear programming formulation in which the dual solution yields those same market clearing prices. We emphasize the similarities with efficient incentive compatible ascending price auctions to implement Vickrey payments when there is a single object or when objects are heterogeneous but each buyer does not desire more than one unit. A potential benefit of these common threads is that it helps to establish the principles upon which Vickrey payments may be implemented through decentralized, incentive compatible procedures.     

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.     

Sequential auctions with randomly arriving buyers

We analyze a dynamic market in which buyers compete in a sequence of private-value auctions for differentiated goods. New buyers and new objects may arrive at random times. Since objects are imperfect substitutes, buyers? values are not persistent. Instead, each buyer?s private value for a new object is a new independent draw from the same distribution.We consider the use of second-price auctions for selling these objects, and show that there exists a unique symmetric Markov equilibrium in this market. In equilibrium, buyers shade their bids down by their continuation value, which is the (endogenous) option value of participating in future auctions. We characterize this option value and show that it depends not only on the number of buyers currently present on the market and the distribution of their values, but also on anticipated market dynamics.     

Consistent House Allocation

In practice we often face the problem of assigning indivisible objects (e.g., schools, housing, jobs, offices) to agents (e.g., students, homeless, workers, professors) when monetary compensations are not possible. We show that a rule that satisfies consistency, strategy-proofness, and efficiency must be an efficient generalized priority rule; i.e., it must adapt to an acyclic priority structure, except – maybe – for up to three agents in each object’s priority ordering. We are grateful to the Editor and an anonymous referee for helpful comments and suggestions. L. Ehlers acknowledges financial support from the SSHRC (Canada)     

On the importance of boundary objects for virtual collaboration: a review of the literature

In this paper, we explore the phenomenon of boundary objects in the process of virtual collaboration. Virtual collaboration is an interactive act that interconnects jointly and voluntarily collaborating individuals that are electronically linked. We regard them as virtual communities (VCs). VCs are characterised by its aim to conduce to shared understanding through an effective use of boundary objects. Artefacts that serve two or more VC members to establish collaboration are seen as boundary objects. The study at hand uses the socio-technical systems theory as a framework to categorise extant research. It draws on the concept of Carlile’s three tiers of boundary objects (syntactic, semantic, and pragmatic) to further sub-categorise scholarly publications between 2004 and 2014. This leads to an in-depth analysis on the use of boundary objects, its effect on the collaboration process as well as a first research agenda for subsequent endeavours in the field of boundary objects and virtual collaboration.     

STRATEGY PROOF AND PRIVACY PRESERVING FAIR ALLOCATION MECHANISM*

We study a fair division problem with indivisible objects such as jobs, houses and one divisible good like money. It is required that each agent be assigned with exactly one object and a certain amount of money. Agents are assumed to have quasi‐linear utilities in money but their reservation values over the objects are private information. A dynamic mechanism is proposed that induces all agents to act honestly rather than strategically and assigns the objects with money to agents efficiently and fairly; at the same time it achieves privacy protection for the agents.     

Strategyproof and Nonbossy Multiple Assignments

We consider the allocation of heterogeneous indivisible objects without using monetary transfers. Each agent may be assigned more than one object. We show that an allocation rule is strategyproof, nonbossy, and satisfies citizen sovereignty if and only if it is a sequential dictatorship . In a sequential dictatorship agents are assigned their favorite objects that are still available, according to a sequentially endogenously determined hierarchy of the agents. We also establish that replacing nonbossiness by a stronger criterion restricts the characterized class of allocation rules to serial dictatorships , in which the hierarchy of the agents is fixed a priori.     

Simultaneous ascending auctions with complementarities and known budget constraints

We study simultaneous ascending auctions of two identical objects when bidders are financially constrained and their valuations exhibit complementarities. We assume the budget constraints are known but the values for individual objects are private information, and characterize noncollusive equilibria. Equilibrium behavior is affected by the exposure problem. Bidders with higher budgets are more reluctant to bid, because opponents with lower budgets may end up pursuing a single object, thus preventing the realization of complementarities. Therefore poor bidders may win both objects when they do not have the highest valuation. We gratefully acknowledge comments by Marco Battaglini, Benny Moldovanu and participants at seminars held at Montreal, Yale, Texas A&M, Washington St. Louis and at the Workshop on Mechanism Design with Budget Constraints held at SUNY - Stony Brook. Sandro Brusco acknowledges financial support from the Ministerio de Educacion y Ciencias D.G.E.S., proyecto SEC2001-0445.     

A simple random assignment problem with a unique solution

Summary. All agents have the same ordinal ranking over all objects, receiving no object (opting out) may be preferable to some objects, agents differ on which objects are worse than opting out, and the latter information is private. The Probabilistic Serial assignment, improves upon (in the Pareto sense) the Random Priority assignment, that randomly orders the agents and offers them successively the most valuable remaining object. We characterize Probabilistic Serial by efficiency in an ordinal sense, and envy-freeness. We characterize it also by ordinal efficiency, strategyproofness and equal treatment of equals. Received: October 5, 1999; revised version: December 20, 2000     

Optimal combinatorial mechanism design

We consider an optimal mechanism design problem with several heterogenous objects and interdependent values. We characterize ex post incentives using an appropriate monotonicity condition and reformulate the problem in such a way that the choice of an allocation rule can be separated from the choice of the payment rule. Central to the analysis is the formulation of a regularity condition, which gives a recipe for the optimal mechanism. If the problem is regular, then an optimal mechanism can be obtained by solving a combinatorial allocation problem in which objects are allocated in a way to maximize the sum of virtual valuations. We identify conditions that imply regularity using the techniques of supermodular optimization.     

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.     

The difference indifference makes in strategy-proof allocation of objects

We study problems of allocating objects among people. Some objects may be initially owned and the rest are unowned. Each person needs exactly one object and initially owns at most one object. We drop the common assumption of strict preferences. Without this assumption, it suffices to study problems where each person initially owns an object and every object is owned. For such problems, when preferences are strict, the “top trading cycles” algorithm provides the only rule that is efficient, strategy-proof, and individually rational Ma (1994) [1]. Our contribution is to generalize this algorithm to accommodate indifference without compromising on efficiency and incentives.     

Sequential vs. single-round uniform-price auctions

We study sequential and single-round uniform-price auctions with affiliated values. We derive symmetric equilibrium for the auction in which k₁ objects are sold in the first round and k₂ in the second round, with and without revelation of the first-round winning bids. We demonstrate that auctioning objects in sequence generates a lowballing effect that reduces the first-round price. Total revenue is greater in a single-round, uniform auction for k=k₁+k₂ objects than in a sequential uniform auction with no bid announcement. When the first-round winning bids are announced, we also identify a positive informational effect on the second-round price. Total expected revenue in a sequential uniform auction with winning-bids announcement may be greater or smaller than in a single-round uniform auction, depending on the model's parameters.     

The Relevance of a Choice of Auction Format in a Competitive Environment

We examine the relevance of an auction format in a competitive environment by comparing uniform and discriminatory price auctions with many bidders in a private values setting. We show that if the number of objects for sale is small relative to the number of bidders, then all equilibria of both auctions are approximately efficient and lead to approximately the same revenue. When the number of objects for sale is proportional to the number of bidders, then the particulars of the auction format matter. All equilibria of the uniform auction are efficient, while all of the equilibria of the discriminatory auction are inefficient. The relative revenue rankings of the auction formats can go in either direction, depending on the specifics of the environment. These conclusions regarding the efficiency and revenue ranking are in contrast to the previous literature, which focused on the case of independent information across agents.     

The Package Assignment Model

We study assignment problems where individuals trade packages consisting of several, rather than single, objects. Although buyers' reservations values are non-additive, efficient assignments can be formulated as a linear programming problem in which the pricing functions expressing duality may be non-linear in the objects constituting the packages. The interconnections among the linear programming formulation, Walrasian equilibrium, and the core are established. In the single seller (auction) version, a necessary and sufficient condition is given for the Vickrey payoff point to be implementable by a pricing equilibrium. Journal of Economic Literature Classification Numbers: C62, D44, D51.     

Multidimensional mechanism design: Revenue maximization and the multiple-good monopoly

The seller of N distinct objects is uncertain about the buyer's valuation for those objects. The seller's problem, to maximize expected revenue, consists of maximizing a linear functional over a convex set of mechanisms. A solution to the seller's problem can always be found in an extreme point of the feasible set. We identify the relevant extreme points and faces of the feasible set. We provide a simple algebraic procedure to determine whether a mechanism is an extreme point. We characterize the mechanisms that maximize revenue for some well-behaved distribution of buyer's valuations.     

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.