首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   231篇
  免费   4篇
管理学   36篇
民族学   2篇
人口学   26篇
理论方法论   16篇
综合类   2篇
社会学   109篇
统计学   44篇
  2021年   2篇
  2020年   3篇
  2019年   6篇
  2018年   6篇
  2017年   11篇
  2016年   5篇
  2015年   5篇
  2014年   7篇
  2013年   28篇
  2012年   13篇
  2011年   19篇
  2010年   7篇
  2009年   8篇
  2008年   6篇
  2007年   11篇
  2006年   9篇
  2005年   4篇
  2004年   5篇
  2003年   4篇
  2002年   9篇
  2001年   6篇
  2000年   10篇
  1999年   6篇
  1998年   2篇
  1997年   4篇
  1996年   3篇
  1995年   3篇
  1994年   4篇
  1993年   3篇
  1992年   2篇
  1991年   3篇
  1990年   2篇
  1988年   2篇
  1986年   2篇
  1983年   1篇
  1982年   3篇
  1980年   1篇
  1977年   1篇
  1974年   1篇
  1972年   1篇
  1971年   2篇
  1970年   1篇
  1969年   1篇
  1967年   1篇
  1964年   1篇
  1961年   1篇
排序方式: 共有235条查询结果,搜索用时 15 毫秒
211.
Review of OPTIMAL CONTROL, EXPECTATIONS AND UNCERTAINTY by Sean Holly and Andrew Hughes Hallett by Scott David Hakala Southern Methodist Univ., Dept. of Economics, Dallas, Tx 75275.  相似文献   
212.
213.
An Approximation Scheme for Bin Packing with Conflicts   总被引:1,自引:1,他引:0  
In this paper we consider the following bin packing problem with conflicts. Given a set of items V = {1,..., n} with sizes s1,..., s (0,1) and a conflict graph G = (V, E), we consider the problem to find a packing for the items into bins of size one such that adjacent items (j, j) E are assigned to different bins. The goal is to find an assignment with a minimum number of bins. This problem is a natural generalization of the classical bin packing problem.We propose an asymptotic approximation scheme for the bin packing problem with conflicts restricted to d-inductive graphs with constant d. This graph class contains trees, grid graphs, planar graphs and graphs with constant treewidth. The algorithm finds an assignment for the items such that the generated number of bins is within a factor of (1 + ) of optimal provided that the optimum number is sufficiently large. The running time of the algorithm is polynomial both in n and in .  相似文献   
214.
Counterexamples to two results by Stalnaker (Theory and Decision, 1994) are given and a corrected version of one of the two results is proved. Stalnaker's proposed results are: (1) if at the true state of an epistemic model of a perfect information game there is common belief in the rationality of every player and common belief that no player has false beliefs (he calls this joint condition strong rationalizability), then the true (or actual) strategy profile is path equivalent to a Nash equilibrium; (2) in a normal-form game a strategy profile is strongly rationalizable if and only if it belongs to C , the set of profiles that survive the iterative deletion of inferior profiles.  相似文献   
215.
We consider the problem of (re)allocating the total endowment of an infinitely divisible commodity among agents with single-peaked preferences and individual endowments. We propose an extension of the so-called uniform rule and show that it is the unique rule satisfying Pareto optimality, strategy-proofness, reversibility, and an equal-treatment condition. The resulting rule turns out to be peaks-only and individually rational: the allocation assigned by the rule depends only on the peaks of the preferences, and no agent is worse off than at his individual endowment. Received: 8 September 1995/Accepted: 30 October 1996  相似文献   
216.
Generation size and structure may have substantial effects on the labor market. This perspective is crucial for the German economy which is one of the most rapidly ageing societies. The paper studies the effects of relative cohort size and relative cohort age on unemployment. The time-series analysis employs cointegration techniques to discriminate between short-run and long-run developments. The econometric investigations suggest that in the long-run, there is no sufficient evidence that young cohorts experience higher unemployment rates if their cohort size is relatively high. In the short-run, there is in general a positive impact of relative cohort size and relative cohort age on unemployment.Revised version of Discussion Paper No. 90-25, University of Munich. A first draft of this paper was written, when I was visiting CentER, Tilburg University. I wish to thank Sijbren Cnossen, John De New, Horst Krämer, Walter Krämer, Winfried Schmahl, Christoph M. Schmidt, Bernard M. S. van Praag, Michael R. Veall, Jürgen Wolters, the participants of the ISPE-conference and three referees of this journal for helpful comments, John De New, Lucie Merkle and Martin Milhleisen for able research assistance, and the German Science Foundation (DFG) for financial support. The paper has also benefited from a research visit to Université Catholique de Louvain, Louvain-la-Neuve.  相似文献   
217.
The optimum growth rate for population reconsidered   总被引:6,自引:5,他引:1  
This article gives exact general conditions for the existence of an interior optimum growth rate for population in the neoclassical two-generations-overlapping model. In an economy where high (low) growth rates of population lead to a growth path that is efficient (inefficient), there always exists an interior optimum growth rate for population. In all other cases, there exists no interior optimum. The Serendipity Theorem, however, does, in general, not hold in an economy with government debt. Moreover, the growth rate for population that leads an economy with debt to a golden rule allocation can never be optimal.   相似文献   
218.
219.
We consider two-sided matching markets with couples. First, we extend a result by Klaus and Klijn (J Econ Theory 21: 75–106, 2005, Theorem 3.3) and show that for any weakly responsive couples market, there always exists a “double stable” matching, i.e., a matching that is stable for the couples market and for any associated singles market. Second, we show that for weakly responsive couples markets, the associated stable correspondence is (Maskin) monotonic and Nash implementable. In contrast, the correspondence that assigns all double stable matchings is neither monotonic nor Nash implementable.  相似文献   
220.
 This paper attempts to provide a unified account of the rationalization of possibly non-binary choice-functions by “Extended Preference Relations” (relations between sets and elements). The analysis focuses on transitive EPRs for which three choice-functional characterizations are given, two of them based on novel axioms. Transitive EPRs are shown to be rationalizable by sets of orderings that are “closed under compromise”; this novel requirement is argued to be the key to establish a canonical relationship between sets of orderings and choice-functions. The traditional assumption of “binariness” on preference relations or choice functions is shown to be analytically unhelpful and normatively unfounded; non-binariness may arise from “unresolvedness of preference”, a previously unrecognized aspect of preference incompleteness. Received: 28 August 1995/Accepted: 14 February 1996  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号