政府奖惩机制下零售商主导的闭环供应链微分博弈策略

本文在考虑政府奖惩机制下,研究零售商主导的闭环供应链中成员的动态均衡策略,其中制造商负责回收再制造,回收率随时间动态变化。分别构建了三种模式下的Stackelberg微分博弈模型:政府不对制造商和零售商实施奖惩机制、政府只对制造商实施奖惩机制以及政府同时对制造商和零售商实施奖惩机制。运用贝尔曼连续型动态规划理论,求解了三种模式下制造商和零售商的决策均衡结果并进行了对比分析,从消费者剩余价值和成员利润的视角证明了政府实施奖惩机制的有效性。最后通过算例对成员均衡策略进行了稳态分析和非稳态分析。研究结果表明:政府的奖惩机制能够正确引导闭环供应链成员做出最优决策,有利于减缓分散决策所带来的双重边际效应,提高消费者剩余价值。零售商分担回收责任会削减政府对制造商回收的激励作用,降低闭环供应链整体利润。相比之下,政府只对制造商实施奖惩机制是最优模式选择,可以同时提高经济和环保双重效益。     

产能约束下的闭环供应链制造商合作策略研究

构建了一个由制造商、回收商和零售商组成的闭环供应链模型,运用Stackelberg博弈对产能约束下制造商的合作策略进行了研究。研究发现:制造商始终有与回收商或零售商合作的经济动机,且当产能较小时,更倾向于与零售商合作;反之,则更倾向与回收商进行合作。此外,相对于无合作模式,不同合作策略对于回收率、供应链整体利润、新产品与再制品总体环境影响程度以及消费者剩余的影响会随着制造商产能大小的变化发生改变,而不同合作策略对于总体环境影响程度的影响与制造商的再制造水平也存在关联。     

云计算开源生态知识共享及风险治理的演化博弈研究

云计算开源生态正在逐步形成,促进知识共享、规避开源风险成为开源运营及开源治理的重要目标。本文基于演化博弈理论,构建了行业自律和政府监管两种治理机制下多方利益相关者(云计算企业、产业联盟以及政府)之间的演化博弈模型,分析了关键参数对各方策略及系统收益的影响。研究发现,在行业自律机制下,违约金和基金会补贴会促进知识共享合作,而产业联盟对于风险的存在则更为敏感。在政府监管机制下,罚款和政府补贴可以帮助参与者平衡风险并促进知识共享合作。研究结果可为云计算开源生态的可持续发展提供决策参考。     

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

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

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）偏好下，证明由企业作选择的选择函数一定是个稳定匹配，由工人做选择的选择函数也是一个稳定匹配．