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

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

2018
Ke Ding Ke Shang Zu-Hua Yu Chuan Yu Yan-Yan Jia Lei He Cheng-Shui Liao Jing Li Chun-Jie Zhang Yin-Ju Li Ting-Cai Wu Xiang-Chao Cheng

Newcastle disease virus (NDV) and Salmonella Pullorum have significant damaging effects on the poultry industry, but no previous vaccine can protect poultry effectively. In this study, a recombinant-attenuated S. Pullorum strain secreting the NDV hemagglutinin-neuraminidase (HN) protein, C79-13ΔcrpΔasd (pYA-HN), was constructed by using the suicide plasmid pREasd-mediated bacteria homologous re...

2006
Arthur H. Goldsmith Darrick Hamilton

JEL Classification Code(s): J 31, J 71) "Perceptions of Discrimination, Effort to Obtain Psychological Balance, and Relative Wages: Can We Infer a Happiness Gradient?" There is a substantial literature that finds a linkage between happiness and relative economic well being as measured by earnings or wages. There is also a well documented racial gap in wages. One explanation for this is disparat...

Journal: Money and Economy 2014

This paper presents an optimal portfolio selection approach based on value at risk (VaR), conditional value at risk (CVaR), worst-case value at risk (WVaR) and partitioned value at risk (PVaR) measures as well as calculating these risk measures. Mathematical solution methods for solving these optimization problems are inadequate and very complex for a portfolio with high number of assets. For t...

2003
Edward Jiménez

This paper analyze Nash’s equilibrium (maximum utilility MU) and its relation with the order state (minimum entropy ME). I introduce the concept of minimum entropy as a paradigm of both Nash-Hayek’s equilibrium. The ME concept is related to Quantum Games. One question arises after completing this exercise: What do the Quantum Mechanics postulates indicate about Game Theory and Economics? Journa...

2016
Andrew Kloosterman Peter Troyan

An important desideratum in priority-based allocation is stability : no agent should claim an object because she has higher priority than the agent to whom it is assigned. However, stable matchings are in general Pareto inefficient, forcing upon designers a difficult trade-off. This paper alleviates this tension between efficiency and stability by defining an assignment to be essentially stable...

2011
Mehmet Barlo Guilherme Carmona

We show that the Folk Theorem holds for n-player discounted repeated game with bounded-memory pure strategies. Our result requires each player’s payoff to be strictly above the pure minmax payoff but requires neither time-dependent strategies, nor public randomization, nor communication. The type of strategies we employ to establish our result turn out to have new features that may be important...

2009
Eric Smith

This paper incorporates assignment frictions and sector-specific training into the Roy model of occupational choice. Assignment frictions represent the extent of the market whereas differences in sector-specific training reflect worker specialization. This framework thus captures Adam Smith’s idea that the extent of the market determines the division of labor. The paper demonstrates the way in ...

Journal: :J. Economic Theory 2014
Lars Ehlers Isa Emin Hafalir M. Bumin Yenmez Muhammed A. Yildirim

Controlled choice over public schools attempts giving parents selection options while maintaining diversity of different student types. In practice, diversity constraints are often enforced by setting hard upper bounds and hard lower bounds for each student type. We demonstrate that, with hard bounds, there might not exist assignments that satisfy standard fairness and non-wastefulness properti...

Journal: :journal of optimization in industrial engineering 2011
mohammad jafar tarokh mehdi yazdani mani sharifi mohammad navid mokhtarian

task assignment problem (tap) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. tap is a combinatorial optimization problem and np-complete. this paper proposes a hybrid meta-heuristic algorithm for solving tap in a h...

Journal: :journal of electrical and computer engineering innovations 0
shahriar minaee jalil imam khomeini international university, qazvin, iran ali khaleghi imam khomeini international university, qazvin, iran

this paper deals with the problem of user-server assignment in online social network systems. online social network applications such as facebook, twitter, or instagram are built on an infrastructure of servers that enables them to communicate with each other. a key factor that determines the facility of communication between the users and the servers is the expected transmission time (ett). a ...

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

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