نتایج جستجو برای: assignment algorithm jel classification c79

تعداد نتایج: 1223808  

2006
Hal R. Varian

I analyze the equilibria of a game based on the ad auction used by Google and Yahoo. This auction is closely related to the assignment game studied by Shapley–Shubik, Demange–Gale–Sotomayer and Roth– Sotomayer. However, due to the special structure of preferences, the equilibria of the ad auction can be calculated explicitly and some known results can be sharpened. I provide some empirical evid...

2007
Neel Rao Michael Kremer Tanya Rosenblat

We combine survey responses, network data, and medical records in order to examine how friends affect the decision to get vaccinated against influenza. The random assignment of undergraduates to residential halls at a large private university generates exogenous variation in exposure to the vaccine, enabling us to credibly identify social effects. We find evidence of positive peer influences on...

2006
Suman Ghosh

This paper presents a theoretical model that combines employers learning about worker productivity, human capital acquisition, job-assignment and resolution of worker uncertainty regarding disutility of work from a job, to show how widely documented findings on both wage and promotion dynamics and turnover can be captured in a single set-up. Specifically we show how our model can capture result...

2010
Simon Luechinger Alois Stutzer Rainer Winkelmann

We discuss a class of copula-based ordered probit models with endogenous switching. Such models can be useful for the analysis of self-selection in subjective well-being equations in general, and job satisfaction in particular, where assignment of regressors may be endogenous rather than random, resulting from individual maximization of well-being. In an application to public and private sector...

Journal: :Mathematical Social Sciences 2009
Fuhito Kojima

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, envy-free and weakly strategy-proof. When each agent receives more than one object, we propose a generalized probabilistic serial mechanism that is ordinally efficient and envy-free but not weakly s...

2016
William C. Grant Kevin J. Anstrom

Randomized trials can be compromised by selection bias, particularly when enrollment is sequential and previous assignments are unmasked. In such contexts, an appropriate randomization procedure minimizes selection bias while satisfying the need for treatment balance. This paper presents optimal randomization mechanisms based on non-cooperative game theory and the statistics of selection bias. ...

2007
Alexander K. Koch Julia Nafziger

Job Assignments under Moral Hazard: The Peter Principle Revisited The Peter Principle captures two stylized facts about hierarchies: first, promotions often place employees into jobs for which they are less well suited than for that previously held. Second, demotions are extremely rare. Why do organizations not correct ‘wrong’ promotion decision? This paper shows in a complete contracting setti...

2013
Michihito Ando

In a Regression Kink (RK) design with a finite sample, a confounding smooth nonlinear relationship between an assignment variable and an outcome variable around a threshold can be spuriously picked up as a kink and result in a biased estimate. In order to investigate how well RK designs handle such confounding nonlinearity, I firstly implement Monte Carlo simulations and then study the effect o...

Journal: :journal of optimization in industrial engineering 2011
mohamad mirzazadeh gholam hasan shirdel behrooz masoumi

assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. in this study, we solve quadratic assignment problem (qap), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. it should be noted that any facility must be assign to only one location. in this paper, first o...

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید