Results 1  10
of
6,648
Random Choice as Behavioral Optimization †
, 2010
"... We study random choice rules to capture violations of the weak axiom of revealed preference. We show that the Luce rule is the unique random choice rule that admits a welldefined ranking of option sets. We consider two extensions of the Luce rule. The first, addresses the duplicates problem. The se ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We study random choice rules to capture violations of the weak axiom of revealed preference. We show that the Luce rule is the unique random choice rule that admits a welldefined ranking of option sets. We consider two extensions of the Luce rule. The first, addresses the duplicates problem
Random Choice and Market Demand
, 2010
"... I characterize mean (or market) demands derived from a general random choice model that does not require the use of preferences or maximizing behavior. I show that mean demands satisfy the compensated Law of Demand and all the properties of standard demand theory including symmetry and negative semi ..."
Abstract
 Add to MetaCart
I characterize mean (or market) demands derived from a general random choice model that does not require the use of preferences or maximizing behavior. I show that mean demands satisfy the compensated Law of Demand and all the properties of standard demand theory including symmetry and negative
Randomized Algorithms
, 1995
"... Randomized algorithms, once viewed as a tool in computational number theory, have by now found widespread application. Growth has been fueled by the two major benefits of randomization: simplicity and speed. For many applications a randomized algorithm is the fastest algorithm available, or the simp ..."
Abstract

Cited by 2196 (36 self)
 Add to MetaCart
, or the simplest, or both. A randomized algorithm is an algorithm that uses random numbers to influence the choices it makes in the course of its computation. Thus its behavior (typically quantified as running time or quality of output) varies from
Random choice and private information
, 2013
"... We consider an agent who chooses from a set of options after receiving some private information. This information however is unobserved by an analyst, so from the latter’s perspective, choice is probabilistic or random. We provide a theory in which information can be fully identified from random cho ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider an agent who chooses from a set of options after receiving some private information. This information however is unobserved by an analyst, so from the latter’s perspective, choice is probabilistic or random. We provide a theory in which information can be fully identified from random
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
Dependent Random Choice
"... We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small subsets have many common neighbors. Recently this technique has had several striking applications to Extremal Graph Theory ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small subsets have many common neighbors. Recently this technique has had several striking applications to Extremal Graph Theory, Ramsey Theory, Additive Combinatorics, and Combinatorial Geometry. In this survey we discuss some of them.
Essays on Random Choice
, 2015
"... (Article begins on next page) The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters. ..."
Abstract
 Add to MetaCart
(Article begins on next page) The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters.
On the time course of perceptual choice: the leaky competing accumulator model
 PSYCHOLOGICAL REVIEW
, 2001
"... The time course of perceptual choice is discussed in a model based on gradual and stochastic accumulation of information in nonlinear decision units with leakage (or decay of activation) and competition through lateral inhibition. In special cases, the model becomes equivalent to a classical diffus ..."
Abstract

Cited by 480 (19 self)
 Add to MetaCart
diffusion process, but leakage and mutual inhibition work together to address several challenges to existing diffusion, randomwalk, and accumulator models. The model provides a good account of data from choice tasks using both timecontrolled (e.g., deadline or response signal) and standard reaction time
Random choice solution of hyperbolic systems
 J. Comp. Phys
, 1976
"... A random choice method for solving nonlinear hyperbolic systems of conservation laws is presented. The method is rooted in Glirnm’s constructive proof that such systems have solutions. The solution is advanced in time by a sequence of operations which includes the solution of Riemann problems and a ..."
Abstract

Cited by 36 (0 self)
 Add to MetaCart
A random choice method for solving nonlinear hyperbolic systems of conservation laws is presented. The method is rooted in Glirnm’s constructive proof that such systems have solutions. The solution is advanced in time by a sequence of operations which includes the solution of Riemann problems and a
Making random choices invisible to the scheduler
 In Proc. of CONCUR’07). To appear
, 2007
"... Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to resolve the nondeterminism. It has been observed that for certain applications, notably those in security, the scheduler ne ..."
Abstract

Cited by 22 (9 self)
 Add to MetaCart
needs to be restricted so not to reveal the outcome of the protocol’s random choices, or otherwise the model of adversary would be too strong even for “obviously correct ” protocols. We propose a processalgebraic framework in which the control on the scheduler can be specified in syntactic terms
Results 1  10
of
6,648