首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1558篇
  免费   382篇
  国内免费   34篇
化学   11篇
力学   34篇
综合类   16篇
数学   1677篇
物理学   236篇
  2023年   15篇
  2022年   92篇
  2021年   107篇
  2020年   94篇
  2019年   79篇
  2018年   84篇
  2017年   68篇
  2016年   55篇
  2015年   39篇
  2014年   105篇
  2013年   120篇
  2012年   95篇
  2011年   92篇
  2010年   108篇
  2009年   90篇
  2008年   84篇
  2007年   109篇
  2006年   96篇
  2005年   63篇
  2004年   53篇
  2003年   45篇
  2002年   38篇
  2001年   29篇
  2000年   29篇
  1999年   15篇
  1998年   21篇
  1997年   13篇
  1996年   16篇
  1995年   14篇
  1994年   11篇
  1993年   10篇
  1992年   11篇
  1991年   6篇
  1990年   4篇
  1989年   4篇
  1988年   4篇
  1987年   4篇
  1986年   3篇
  1985年   7篇
  1984年   7篇
  1983年   6篇
  1982年   11篇
  1981年   4篇
  1980年   3篇
  1979年   4篇
  1976年   2篇
  1975年   1篇
  1974年   1篇
  1970年   1篇
  1957年   1篇
排序方式: 共有1974条查询结果,搜索用时 546 毫秒
131.
博弈论为理论依据,通过对高、低两种任务下买税利益团体和上级监管部门的利益偏好和行为特征进行建模对比分析,考察影响其行为的各种因素,从经济学角度探求引起“买税”行为的根源,并试着给出建议.  相似文献   
132.
In this paper, we prove the existence and uniqueness result of the reflected BSDE with two continuous barriers under monotonicity and general increasing condition on y, with Lipschitz condition on z.  相似文献   
133.
Under the One-step Look Ahead rule of Dynamic Programming, an explicit game value of Dynkin's stopping problem for a Markov chain is obtained by using a potential operator. The condition on the One-step rule could be extended to the k-step and infinity-step rule. We shall also decompose the game value as the sum of two explicit functions under these rules.  相似文献   
134.
As is well known, the problem of finding a maximum clique in a graph isNP-hard. Nevertheless, NP-hard problems may have easy instances. This paperproposes a new, global optimization algorithm which tries to exploit favourabledata constellations, focussing on the continuous problem formulation: maximizea quadratic form over the standard simplex. Some general connections of thelatter problem with dynamic principles of evolutionary game theory areestablished. As an immediate consequence, one obtains a procedure whichconsists (a) of an iterative part similar to interior-path methods based on theso-called replicator dynamics; and (b) a routine to escape from inefficient,locally optimal solutions. For the special case of finding a maximum clique ina graph where the quadratic form arises from a regularization of the adjacencematrix, part (b), i.e. escaping from maximal cliques not of maximal size, isaccomplished with block pivoting methods based on (large) independent sets,i.e. cliques of the complementary graph. A simulation study is included whichindicates that the resulting procedure indeed has some merits.  相似文献   
135.
This paper is concerned with the strategic use of a private information on the stock market. A repeated auction model is used to analyze the evolution of the price system on a market with asymmetric information.  The model turns out to be a zero-sum repeated game with one-sided information, as introduced by Aumann and Maschler.  The stochastic evolution of the price system can be explicitly computed in the n times repeated case. As n grows to ∞, this process tends to a continuous time martingale related to a Brownian Motion.  This paper provides in this way an endogenous justification for the appearance of Brownian Motion in Finance theory. Received: February 2002  相似文献   
136.
We consider Nash equilibria in 2‐player random games and analyze a simple Las Vegas algorithm for finding an equilibrium. The algorithm is combinatorial and always finds a Nash equilibrium; on m × n payoff matrices, it runs in time O(m2nloglog n + n2mloglog m) with high probability. Our result follows from showing that a 2‐player random game has a Nash equilibrium with supports of size two with high probability, at least 1 − O(1/log n). Our main tool is a polytope formulation of equilibria. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007  相似文献   
137.
We consider a network of d companies (insurance companies, for example) operating under a treaty to diversify risk. Internal and external borrowing are allowed to avert ruin of any member of the network. The amount borrowed to prevent ruin is viewed upon as control. Repayment of these loans entails a control cost in addition to the usual costs. Each company tries to minimize its repayment liability. This leads to a d -person differential game with state space constraints. If the companies are also in possible competition a Nash equilibrium is sought. Otherwise a utopian equilibrium is more appropriate. The corresponding systems of HJB equations and boundary conditions are derived. In the case of Nash equilibrium, the Hamiltonian can be discontinuous; there are d interlinked control problems with state constraints; each value function is a constrained viscosity solution to the appropriate discontinuous HJB equation. Uniqueness does not hold in general in this case. In the case of utopian equilibrium, each value function turns out to be the unique constrained viscosity solution to the appropriate HJB equation. Connection with Skorokhod problem is briefly discussed.  相似文献   
138.
In this paper we are concerned with zero-sum differential games with impulse controls, as well as continuous and switching controls. The motivation is optimal impulse control problems with disturbances. The main result is the existence of the value function of the game. Our approach is the theory of viscosity solutions for Hamilton-Jacobi equations.Part of this paper was done while the author was a visiting scholar at INRIA, Sophia-Antipolis, France. This work was also partially supported by the Chinese NSF, the Chinese State Education Commission Science Foundation, and the Fok Ying Tung Education Foundation.  相似文献   
139.
We focus on the heterogeneity of social networks and its role to the emergence of prevailing cooperators and sustainable cooperation. The social networks are representative of the interaction relationships between players and their encounters in each round of games. We study an evolutionary Prisoner's Dilemma game on a variant of Newman-Watts small-world network, whose heterogeneity can be tuned by a parameter. It is found that optimal cooperation level exists at some intermediate topological heterogeneity for different temptations to defect. That is, frequency of cooperators peaks at a certain specific value of degree heterogeneity — neither the most heterogeneous case nor the most homogeneous one would favor the cooperators. Besides, the average degree of networks and the adopted update rule also affect the cooperation level.  相似文献   
140.
We analyze an infinitely repeated version of the Downsian model of elections. The folk theorem suggests that a wide range of policy paths can be supported by subgame perfect equilibria when parties and voters are sufficiently patient. We go beyond this result by imposing several suitable refinements and by giving separate weak conditions on the patience of voters and the patience of parties under which every policy path can be supported. On the other hand, we show that only majority undominated policy paths can be supported in equilibrium for arbitrarily low voter discount factors: if the core is empty, the generic case in multiple dimensions, then voter impatience leads us back to the problem of non-existence of equilibrium. We extend this result to give conditions under which core equivalence holds for a non-trivial range of voter and party discount factors, providing a game-theoretic version of the Median Voter Theorem in a model of repeated Downsian elections. J. Duggan was supported by the National Science Foundation, grant number 0213738, is gratefully acknowledged.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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