Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 17 of 17 for “"Matrix Games"”.

  1. Convergence of behaviour rules in iterated matrix games

    … the paper with some numerical results from three games - a zero-sum game, a game developed by Lloyd Shapley (called the Shapley game) and a game called Battle of the Buddies. They are designed to give some numerical confirmation of the convergence theorems stated earlier in the paper as well as …

    ubc Repository record for Convergence of behaviour rules in iterated matrix games (opens in a new tab) Download PDF for Convergence of behaviour rules in iterated matrix games (opens in a new tab)

  2. Formulation and solution of matrix games without utility functions

    … The random character of the "real" payoff of a matrix game is then discussed, and the probability distribution function of the payoff is derived. The dependence of this distribution function upon the mixed strategies of the players is shown. Criteria are developed to provide definition of …

    nps Repository record for Formulation and solution of matrix games without utility functions (opens in a new tab)

  3. Multiple Solutions of Two- person Zero-sum Matrix Games

    … multiple solutions of two - person , zero-sum matrix games . The method used is an extension of the Symmetric Method of linear programming developed by J . V. Talacko and R. Tyrrell Rockafellar . References to their papers will be cited later . An abstract proof of the arguments presented here …

    marquette Repository record for Multiple Solutions of Two- person Zero-sum Matrix Games (opens in a new tab)

  4. Relationships between linear programming and matrix games with economic applications

    … the relationship between linear programming and matrix games with economic applications.</p> <p>Along with the definitions of linear programming problems and matrix games various properties and algorithms of linear programming and matrix games are discussed.</p> <p>Also, the conversion of matrix …

    ut-knoxville Repository record for Relationships between linear programming and matrix games with economic applications (opens in a new tab)

  5. Generation Capacity Expansion in Restructured Energy Markets

    … capacity expansion plans. To solve the matrix games that arise in the generation expansion planning (GEP) model, we first develop a novel value function approximation based reinforcement learning (RL) algorithm. Currently there exist only mathematical programming based solution …

    usf Repository record for Generation Capacity Expansion in Restructured Energy Markets (opens in a new tab)

  6. Reduction of games using dominant strategies

    … These results are used to reduce some infinite games of the Colonel Blotto type to finite matrix games which are then solved by the Snow-Shapley theorem.

    ubc Repository record for Reduction of games using dominant strategies (opens in a new tab) Download PDF for Reduction of games using dominant strategies (opens in a new tab)

  7. Limitations and Extensions of the WoLF-PHC Algorithm

    … to learn probabilistic policies for multi-agent games. WoLF-PHC extends PHC with the "win or learn fast" principle. A proof that PHC will diverge in self-play when playing Shapley's game is given, and WoLF-PHC is shown empirically to diverge as well. Various WoLF-PHC based modifications were …

    byu Repository record for Limitations and Extensions of the WoLF-PHC Algorithm (opens in a new tab) Download PDF for Limitations and Extensions of the WoLF-PHC Algorithm (opens in a new tab)

  8. A regularization perspective on spectral sparsification

    … sparsification and regret minimization in online matrix games, i.e.,online convex programming over the positive semidefinite cone. While this connec-tion was previously noted [24, 47], we formally reduce graph sparsification to a matrixregret minimization problem, which we solve by applying mirror …

    bu Repository record for A regularization perspective on spectral sparsification (opens in a new tab)

  9. Equitable Efficiency in Multiple Criteria Optimization

    … type of linear complementarity problem and matrix games. The set of equitably efficient solutions, in general, is a subset of efficient solutions. The multiple criteria alternative of the linear complementarity problem dealt in our dissertation has identical efficient and equitably efficient …

    clemson Repository record for Equitable Efficiency in Multiple Criteria Optimization (opens in a new tab)

  10. Sample efficient multiagent learning in the presence of Markovian agents

    … in the stylized settings provided by repeated matrix games. The goal of this thesis is to develop MAL algorithms for such a setting that achieve a new set of objectives which have not been previously achieved. The thesis makes three main contributions. The first main contribution proposes a …

    texas Repository record for Sample efficient multiagent learning in the presence of Markovian agents (opens in a new tab)

  11. Quantum Computing for Optimization and Machine Learning

    … we demonstrate a quantum algorithm for solving matrix games, which can be applied to a variety of learning problems such as linear classification, minimum enclosing ball, and $\ell-2$ margin SVMs. We then shift our focus to variational quantum algorithms, which describe a family of heuristic …

    maryland Repository record for Quantum Computing for Optimization and Machine Learning (opens in a new tab)

  12. A model predictive control approach to a class of multiplayer minmax differential games

    … a class of two-team adversarial differential games in which there are multiple mobile dynamic agents on each team. We describe such games in terms of semi-infinite minmax Model Predictive Control (MPC) problems, and present a numerical optimization technique for efficiently solving them. We …

    uiuc Repository record for A model predictive control approach to a class of multiplayer minmax differential games (opens in a new tab)

  13. Learning Average Reward Irreducible Stochastic Games: Analysis and Applications

    … makers/agents can be modeled as stochastic games. Stochastic games having Markov properties are called Markov games or competitive Markov decision processes. This dissertation presents an approach to solve non cooperative stochastic games, in which each decision maker makes her/his own …

    usf Repository record for Learning Average Reward Irreducible Stochastic Games: Analysis and Applications (opens in a new tab)

  14. Game theoretic analysis and design for network security

    … which can be viewed as sequences of nonzero-sum matrix games between an Attacker and a Defender. Players do not have access to each other's payoff matrix. Each has to observe the other's actions up to the present and plays the action generated based on the best response to these observations. …

    uiuc Repository record for Game theoretic analysis and design for network security (opens in a new tab)

  15. Multi-objective path-planning for autonomous agents using dynamic game theory

    … structure of two-player zero-sum differential games. Many modern decision-making problems, however, cannot be put under the umbrella of zero-sum games because they involve complex interplay between multiple agents, which is not purely antagonistic. In this context, we address a special class of …

    texas Repository record for Multi-objective path-planning for autonomous agents using dynamic game theory (opens in a new tab)