Results 1  10
of
14,637
Effects with Random Assignment: Results for Dartmouth Roommates
, 2001
"... This paper uses a unique data set to measure peer effects among college roommates. Freshman year roommates and dormmates are randomly assigned at Dartmouth College. I find that peers have an impact on grade point average and on decisions to join social groups such as fraternities. Residential peer e ..."
Abstract

Cited by 554 (6 self)
 Add to MetaCart
This paper uses a unique data set to measure peer effects among college roommates. Freshman year roommates and dormmates are randomly assigned at Dartmouth College. I find that peers have an impact on grade point average and on decisions to join social groups such as fraternities. Residential peer
On Popular Random Assignments
, 2013
"... One of the most fundamental and ubiquitous problems in microeconomics and operations research is how to assign objects to agents based on their individual preferences. An assignment is called popular if there is no other assignment that is preferred by a majority of the agents. Popular assignments ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
need not exist, but the minimax theorem implies the existence of popular random assignments. In this paper, we study the compatibility of popularity with other properties that have been considered in the literature on random assignments, namely efficiency, equal treatment of equals, envy
Asymptotics in the random assignment problem
 PROBABILITY THEORY
, 1992
"... We show that, in the usual probabilistic model for the random assignment problem, the optimal cost tends to a limit constant in probability and in expectation. The method involves construction of an infinite limit structure, in terms of which the limit constant is defined. But we cannot improve on ..."
Abstract
 Add to MetaCart
We show that, in the usual probabilistic model for the random assignment problem, the optimal cost tends to a limit constant in probability and in expectation. The method involves construction of an infinite limit structure, in terms of which the limit constant is defined. But we cannot improve
Random Assignment with Integer Costs
 COMBIN. PROBAB. COMPUT
, 2001
"... The random assignment problem is to minimize the cost of an assignment in a nn matrix of random costs. In this paper we study this problem for some integer valued cost distributions. We consider both uniform distributions on 1, 2, . . . , m, for m = n or n 2 , and random permutations of 1, 2, . . . ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The random assignment problem is to minimize the cost of an assignment in a nn matrix of random costs. In this paper we study this problem for some integer valued cost distributions. We consider both uniform distributions on 1, 2, . . . , m, for m = n or n 2 , and random permutations of 1, 2
in Large Random Assignment Economies
, 2011
"... I study large random assignment economies with a continuum of agents and a …nite number of object types. I consider the existence of weak priorities discriminating among agents with respect to their rights concerning the …nal assignment. The respect for priorities ex ante (exante stability) usually ..."
Abstract
 Add to MetaCart
I study large random assignment economies with a continuum of agents and a …nite number of object types. I consider the existence of weak priorities discriminating among agents with respect to their rights concerning the …nal assignment. The respect for priorities ex ante (exante stability
Random Assignment of Multiple Indivisible Objects
 FORTHCOMING, MATHEMATICAL SOCIAL SCIENCES
, 2008
"... We consider random assignment of multiple indivisible objects. When each agent receives one object, Bogomolnaia and Moulin (2001) show that the probabilistic serial mechanism is ordinally efficient, envyfree and weakly strategyproof. When each agent receives more than one object, we propose a gen ..."
Abstract

Cited by 24 (6 self)
 Add to MetaCart
We consider random assignment of multiple indivisible objects. When each agent receives one object, Bogomolnaia and Moulin (2001) show that the probabilistic serial mechanism is ordinally efficient, envyfree and weakly strategyproof. When each agent receives more than one object, we propose a
Welfare Economics in Random Assignment Economies
, 2013
"... We study random assignment economies with expectedutility agents, each of them eventually obtaining a single object. Inspired on Hylland and Zeckhauser’s (1979) Pseudomarket mechanism (PM) and on a serial dictatorship, we introduce the Sequential Pseudomarket (SP) where groups of agents are called t ..."
Abstract
 Add to MetaCart
We study random assignment economies with expectedutility agents, each of them eventually obtaining a single object. Inspired on Hylland and Zeckhauser’s (1979) Pseudomarket mechanism (PM) and on a serial dictatorship, we introduce the Sequential Pseudomarket (SP) where groups of agents are called
Random assignment and shortest path problems
, 2006
"... We explore a similarity between the n by n random assignment problem and the random shortest path problem on the complete graph on n + 1 vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by C. Nair, B. Prabhakar and M. Sharma in 2003. We g ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
We explore a similarity between the n by n random assignment problem and the random shortest path problem on the complete graph on n + 1 vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by C. Nair, B. Prabhakar and M. Sharma in 2003. We
On the Advantage Over a Random Assignment
 Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002
, 2002
"... ABSTRACT We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. Since the random assignment algorithm is known to give essentially the best possible polynomial time approximation algorithm for m ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
ABSTRACT We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. Since the random assignment algorithm is known to give essentially the best possible polynomial time approximation algorithm
Results 1  10
of
14,637