基于异质预期的量子伯川德博弈复杂动力机制分析

针对伯川德双寡头垄断博弈经济系统中出现的混沌现象,利用量子博弈论,构建了基于有限理性与天真预期行为的量子伯川德动态博弈模型,分析了量子纠缠度对纳什均衡点稳定性及复杂动力行为的影响。结果表明:量子纠缠度能增强该系统的稳定性,企业价格调整速度达到某一程度时会导致该系统的复杂混沌特性,纠缠度可以有效控制混沌状态。最后利用数值模拟从分岔、最大李雅普诺夫指数、奇怪吸引子、初始条件敏感性及分数维数方面验证了理论准确性。     

The combinatorial game Nofil played on Steiner triple systems

We introduce an impartial combinatorial game on Steiner triple systems called Next One to Fill Is the Loser (Nofil ). Players move alternately, choosing points of the triple system. If a player is forced to fill a block on their turn, they lose. By computing nim-values, we determine optimal strategies for Nofil on all Steiner triple systems up to order 15 and a sampling for orders 19, 21 and 25. The game Nofil can be thought of in terms of play on a corresponding hypergraph which will become a graph during play. At that point Nofil is equivalent to playing the game Node Kayles on the graph. We prove necessary conditions and sufficient conditions for a graph to reached playing Nofil. We conclude that the complexity of determining the outcome of the game Nofil on Steiner triple systems is PSPACE-complete for randomized reductions.     

Cyclical games with prohibitions

We consider a certain combinatorial game on a digraph for two cases of the price function. For one case the game in question extends the cyclical game studied in Ehrenfeucht and Mycielski (1979) and Gurvitch, Karzanov and Khachiyan (1988) which, in its turn, is a generalization of the well-known problem of finding a minimum mean cycle in an edge-weighted digraph. We prove the existence of optimal uniform stationary strategies for both cases and give algorithms to find such strategies.This work was partially supported by Chaire municipale, Mairie de Grenoble.     

Necessary and sufficient conditions for the existence of positive solutions to algebraic Riccati equations with indefinite quadratic term

Necessary and sufficient conditions are established in this paper for the existence of positive- and/or negative-definite solutions to the algebraic Riccati equation with indefinite coefficient. An iterative procedure is also given for computing such a solution.Project supported by the National Science Foundation of China and by the special program of the State Education Commission of China under grant 9033507.     

Chip-Firing Games on Directed Graphs

We consider the following (solitary) game: each node of a directed graph contains a pile of chips. A move consists of selecting a node with at least as many chips as its outdegree, and sending one chip along each outgoing edge to its neighbors. We extend to directed graphs several results on the undirected version obtained earlier by the authors, P. Shor, and G. Tardos, and we discuss some new topics such as periodicity, reachability, and probabilistic aspects.Among the new results specifically concerning digraphs, we relate the length of the shortest period of an infinite game to the length of the longest terminating game, and also to the access time of random walks on the same graph. These questions involve a study of the Laplace operator for directed graphs. We show that for many graphs, in particular for undirected graphs, the problem whether a given position of the chips can be reached from the initial position is polynomial time solvable.Finally, we show how the basic properties of the probabilistic abacus can be derived from our results.     

Phenomenology of nonlocal cellular automata

Dynamical systems with nonlocal connections have potential applications to economic and biological systems. This paper studies the dynamics of nonlocal cellular automata. In particular, all two-state, three-input nonlocal cellular automata are classified according to the dynamical behavior starting from random initial configurations and random wirings, although it is observed that sometimes a rule can have different dynamical behaviors with different wirings. The nonlocal cellular automata rule space is studied using a mean-field parametrization which is ideal for the situation of random wiring. Nonlocal cellular automata can be considered as computers carrying out computation at the level of each component. Their computational abilities are studied from the point of view of whether they contain many basic logical gates. In particular, I ask the question of whether a three-input cellular automaton rule contains the three fundamental logical gates: two-input rules AND and OR, and one-input rule NOT. A particularly interesting edge-of-chaos nonlocal cellular automaton, the rule 184, is studied in detail. It is a system of coupled selectors or multiplexers. It is also part of the Fredkin's gate—a proposed fundamental gate for conservative computations. This rule exhibits irregular fluctuations of density, large coherent structures, and long transient times.     

多对一双方匹配市场中的最优化

在双方市场中定义的博弈概念，可以使市场同方参与者的收益同时达到最大．这种最优化存在的理论依据是选择匹配的稳定性．用博弈论的分析与证明方法研宄多对一双方匹配市场中的最优化．在替代偏好和LAD（Law of Aggregate Demend）偏好下，证明由企业作选择的选择函数一定是个稳定匹配，由工人做选择的选择函数也是一个稳定匹配．     

Surplus division and investment incentives in supply chains: A biform-game analysis

In this paper, we use a biform-game approach for analyzing the impact of surplus division in supply chains on investment incentives. In the first stage of the game, firms decide non-cooperatively on investments. In the second stage, the surplus is shared according to the Shapley value. We find that all firms have inefficiently low investment incentives which, however, depend on their position in the supply chain. Cross-subsidies for investment costs can mitigate, but not eliminate the underinvestment problem. Vertical integration between at least some firms.yields efficient investments, but may nevertheless reduce the aggregated payoff of the firms. We show how the size of our effects depends on the structure of the supply chain and the efficiency of the investment technology. Various extensions demonstrate that our results are qualitatively robust.     

On the feedback solutions of differential oligopoly games with hyperbolic demand curve and capacity accumulation

To safeguard analytical tractability and the concavity of objective functions, the vast majority of models belonging to oligopoly theory relies on the restrictive assumption of linear demand functions. Here we lay out the analytical solution of a differential Cournot game with hyperbolic inverse demand, where firms accumulate capacity over time à la Ramsey. The subgame perfect equilibrium is characterized via the Hamilton–Jacobi–Bellman equations solved in closed form both on infinite and on finite horizon setups. To illustrate the applicability of our model and its implications, we analyze the feasibility of horizontal mergers in both static and dynamic settings, and find appropriate conditions for their profitability under both circumstances. Static profitability of a merger implies dynamic profitability of the same merger. It appears that such a demand structure makes mergers more likely to occur than they would on the basis of the standard linear inverse demand.