Search Results

1 - 6 of 6 items :

  • game graphs x
  • Applied Mathematics x
Clear All
Convergence method, properties and computational complexity for Lyapunov games

, STOC 2006, Seattle, WA, USA , pp. 71-78. Daskalakis, C., Mehta, A. and Papadimitriou, C. (2006b). A note on approximate Nash equilibria, Proceedings of the 2nd Workshop on Internet and Network Economics, WINE 06, Patras, Greece , pp. 297-306. Fabrikant, A. and Papadimitriou, C. (2008). The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, CA, USA , pp. 844

Open access
A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria

simple games and vector-weighted majority games by means of binary decision diagrams, European Journal of Operational Research 210(2): 258-272. Bonanno, G. (2001). Branching time, perfect information games, and backward induction, Games and Economic Behavior 36(1): 57-73. Bryant, R.E. (1986). Graph-based algorithms for Boolean function manipulation, IEEE Transactions on Computers 35(8): 677-691. Burch, J., Clarke, E., McMillan, K., Dill, D. and Hwang, L. (1992). Symbolic model checking: 1020 states and beyond, Information

Open access
Decomposition-based logic synthesis for PAL-based CPLDs

., Sangiovanni-Vincentelli, A. L., McMullen, C. T. and Hachtel, G. D. (1984). Logic Minimization Algorithms for VLSI Synthesis , Kluwer Academic Publishers, Norwell, MA. Bryant, R. E. (1986). Graph-based algorithms for Boolean function manipulation, IEEE Transactions on Computers   35 (8): 677-691. Burns, M., Perkowski, M., Jóźwiak, L. and Grygiel, S. (1998). An efficient and effective approach to column-based input/output encoding in functional decomposition, Proceedings of the 3rd International Workshop on Boolean

Open access
The self-similarity properties and multifractal analysis of DNA sequences

as the human genome, are made up of 3000 million base pairs [ 1 ]. In the National Center for Biotechnology Information (NCBI) directories are the databases that contain complete genomes, complete sequences of chromosomes, sequences of mRNAs, and proteins. The importance to analyse the large DNA databases in the Nonlinear Dynamics context is based on the work conducted earlier by Jeffrey [ 2 ], who proposed a graphic representation of these databases via an extended chaos game. Other contributions similarly based on a statistical description of DNA sequences take

Open access
Shapley-Folkman-Lyapunov theorem and Asymmetric First price auctions

∫ 0 x e − t 2 d t , $$\begin{array}{} \displaystyle erf (z)=\frac{2}{\sqrt\pi}\int_0^x e^{-t^2 } dt, \end{array}$$ see ( Abramowitz and Stegun 1964 ). Matlab code for this simple two bidder case was written by ( Fibich and Gavish 2011 ). In the next two graphs are presented two bidder’s distribution valuations. Fig. 1 Fixed point iterations result of the ratios of the two bidders’ valuations CDF/PDF functions Fig. 2 Newtons iterations result of the two CDF/PDF bidders’ valuations functions 5 Conclusion As it is known

Open access
Optimal control problems for differential equations applied to tumor growth: state of the art

growth of a tumor. They use ordinary differential equations [ 2 , 6 , 13 , 54 ], partial differential equations [ 1 , 3 , 34 ], stochastic processes [ 38 ], game theory [ 52 ], etc. In this review, we focus on 4 applications of the control theory to the growth of tumors: The first is referred to the application of the theory of optimal control to compartmental models. The second deals with the theory of optimal control of brain tumors. The third deals with a topic that is becoming more and more important: the resistance in tumors to different treatments

Open access