全文获取类型
收费全文 | 132篇 |
免费 | 33篇 |
国内免费 | 7篇 |
专业分类
172篇 |
出版年
2024年 | 2篇 |
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 5篇 |
2019年 | 2篇 |
2018年 | 6篇 |
2017年 | 16篇 |
2016年 | 14篇 |
2015年 | 1篇 |
2014年 | 7篇 |
2013年 | 11篇 |
2012年 | 13篇 |
2011年 | 9篇 |
2010年 | 8篇 |
2009年 | 14篇 |
2008年 | 8篇 |
2007年 | 8篇 |
2006年 | 9篇 |
2005年 | 9篇 |
2004年 | 3篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1999年 | 1篇 |
1996年 | 1篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1990年 | 1篇 |
排序方式: 共有172条查询结果,搜索用时 0 毫秒
91.
We consider a scenario with two firms determining which products to develop and introduce to the market. In this problem, there exists a finite set of potential products and market segments. Each market segment has a preference list of products and will buy its most preferred product among those available. The firms play a Stackelberg game in which the leader firm first introduces a set of products, and the follower responds with its own set of products. The leader's goal is to maximize its profit subject to a product introduction budget, assuming that the follower will attempt to minimize the leader's profit using a budget of its own. We formulate this problem as a multistage integer program amenable to decomposition techniques. Using this formulation, we develop three variations of an exact mathematical programming method for solving the multistage problem, along with a family of heuristic procedures for estimating the follower solution. The efficacy of our approaches is demonstrated on randomly generated test instances. This article contributes to the operations research literature a multistage algorithm that directly addresses difficulties posed by degeneracy, and contributes to the product variety literature an exact optimization algorithm for a novel competitive product introduction problem. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
92.
The problem of detecting a minefield in the presence of clutter can be abstracted to that of detecting a spatial pattern within a set of point locations. The point locations are superpositions of several patterns, one of which corresponds to mines. In contrast to previous articles that take a formal, model‐based approach, this article proposes a statistical methodology that is distinctly exploratory. Each point location is considered separately, and its contributions to a global measure of spatial distances between locations are featured. Different patterns and unusual points can be more easily identified on the new scale. Both minefield data and simulated point patterns demonstrate the power of the method. © 2001 John Wiley & Sons, Inc., Naval Research Logistics 48:333–347, 2001 相似文献
93.
Leaving marks at the starting points in a rendezvous search problem may provide the players with important information. Many of the standard rendezvous search problems are investigated under this new framework which we call markstart rendezvous search. Somewhat surprisingly, the relative difficulties of analysing problems in the two scenarios differ from problem to problem. Symmetric rendezvous on the line seems to be more tractable in the new setting whereas asymmetric rendezvous on the line when the initial distance is chosen by means of a convex distribution appears easier to analyse in the original setting. Results are also obtained for markstart rendezvous on complete graphs and on the line when the players' initial distance is given by an unknown probability distribution. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 722–731, 2001 相似文献
94.
This article deals with a two‐person zero‐sum game in which player I chooses in integer interval [1, N] two integer intervals consisting of p and q points where p + q < N, and player II chooses an integer point in [1, N]. The payoff to player I equals 1 if the point chosen by player II is at least in one of the intervals chosen by player II and 0 otherwise. This paper complements the results obtained by Ruckle, Baston and Bostock, Lee, Garnaev, and Zoroa, Zoroa and Fernández‐Sáez. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 98–106, 2001 相似文献
95.
针对军事欺骗战法定量分析困难的问题,采用基于贝叶斯统计推断和博弈均衡分析的数学方法,在理论上为解决此难题提供了一种可行的方法.该方法首先定义基本概率矩阵,然后根据贝叶斯原理为交战双方构造用于统计推断的主观概率矩阵,并在由两个主观概率矩阵元素构成的偏序链与实施军事欺骗机会之间建立对应关系,再将此关系推广到基本概率矩阵,即是否存在实施军事欺骗的机会将由基本概率矩阵元素构成的偏序链决定.对理论成果的初步应用表明:通过分析由战场情报信息构成的基本概率矩阵的偏序链,可以科学地运用军事欺骗和反军事欺骗战法. 相似文献
96.
Alan Washburn 《海军后勤学研究》2001,48(4):270-280
Gass, Zafra, and Qiu (1996) introduce a modified version of fictitious play for matrix games where only the more successful player's strategy is retained. This paper introduces additional modifications that appear to converge faster. © 2001 John Wiley & Sons, Inc.* Naval Research Logistics 48: 270–280, 2001 相似文献
97.
Myerson 3 and 4 proposed and characterized a modification of the Shapley value in the context of communication situations. In this paper we propose several characterizations of the extension of the Banzhaf value proposed by Owen 7 to communication situations. In particular we characterize this value with the properties of fairness, isolation, and pairwise merging. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
98.
This paper deals with an inspection game of customs and a smuggler. The customs can take two options of assigning a patrol or not. The smuggler has two strategies of shipping its cargo of contraband or not. Two players have several opportunities to take actions during a limited number of days. When both players do, there are some possibilities that the customs captures the smuggler and, simultaneously, the smuggler possibly makes a success of the smuggling. If the smuggler is captured or there remain no days for playing the game, the game ends. In this paper, we formulate the problem into a multi‐stage two‐person zero‐sum stochastic game and investigate some characteristics of the equilibrium solution, some of which are given in a closed form in a special case. There have been some studies so far on the inspection game. However, some consider the case that the smuggler has only one opportunity of smuggling or the perfect‐capture case that the customs can certainly arrest the smuggler on patrol, and others think of a recursive game without the probabilities of fulfilling the players' purposes. In this paper, we consider the inspection game taking account of the fulfillment probabilities of the players' aims. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
99.
100.
Zhimin Huang 《海军后勤学研究》2000,47(8):669-685
This paper explores the role of franchising arrangements in the context of game theory. We assume a single franchisor and a single franchisee channel and address the impact of fixed lump‐sum fees, royalties, wholesale price, and retail price on the franchise contracts. We start with the chance cross‐constrained noncooperative situation where the franchisor, as the leader, first specifies his/her strategies. The franchisee, as the follower, then decides on his/her decision. We then relax the assumption of franchisee's inability to influence the franchisor's decisions and discuss cooperative situation between the franchisor and the franchisee. Nash's bargaining model is utilized to select the best Pareto‐efficient payment scheme for the franchisor and the franchisee to achieve their cooperation. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 669–685, 2000 相似文献