ropt 1.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 3fe90a0a77c2d1d45f71343e380dbad72896a24f15994af400fa8fb17207c685
+  data.tar.gz: 4a13f0f5cf11126c2ea109eabc73436d7e90a37185a6cca3362d998df89532fb
+SHA512:
+  metadata.gz: 3c43e7b7a17b474f646927a3e550d70d6faa782e390929369680382d33bcb98af27d980000f3648eaaecb9ecd9f19290c131cee0a0f745b1c94cd6a5a13154b1
+  data.tar.gz: 915bba2cf9f10556bf04b6a0447fd914e30fcd111715168b03e2d31084b5c6da62fc6a50d5043df5f5b1cd3f9d5372cf14fc93863019c4c1b009a36eff5fe203

data/.rspec

@@ -0,0 +1,3 @@
+--format documentation
+--color
+--require spec_helper

data/.rubocop.yml

@@ -0,0 +1,25 @@
+require:
+  - rubocop-rake
+  - rubocop-rspec
+  - rubocop-performance
+
+AllCops:
+  TargetRubyVersion: 3.3
+  NewCops: enable
+
+Style/StringLiterals:
+  Enabled: true
+  EnforcedStyle: double_quotes
+
+Style/StringLiteralsInInterpolation:
+  Enabled: true
+  EnforcedStyle: double_quotes
+
+Layout/LineLength:
+  Max: 120
+
+RSpec/NestedGroups:
+  Max: 5
+
+Gemspec/RequiredRubyVersion:
+  Enabled: false

data/CHANGELOG.md

@@ -0,0 +1,5 @@
+## [Unreleased]
+
+## [1.0.0] - 2024-02-19
+
+- Initial release

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,84 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+We as members, contributors, and leaders pledge to make participation in our community a harassment-free experience for everyone, regardless of age, body size, visible or invisible disability, ethnicity, sex characteristics, gender identity and expression, level of experience, education, socio-economic status, nationality, personal appearance, race, religion, or sexual identity and orientation.
+
+We pledge to act and interact in ways that contribute to an open, welcoming, diverse, inclusive, and healthy community.
+
+## Our Standards
+
+Examples of behavior that contributes to a positive environment for our community include:
+
+* Demonstrating empathy and kindness toward other people
+* Being respectful of differing opinions, viewpoints, and experiences
+* Giving and gracefully accepting constructive feedback
+* Accepting responsibility and apologizing to those affected by our mistakes, and learning from the experience
+* Focusing on what is best not just for us as individuals, but for the overall community
+
+Examples of unacceptable behavior include:
+
+* The use of sexualized language or imagery, and sexual attention or
+  advances of any kind
+* Trolling, insulting or derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or email
+  address, without their explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Enforcement Responsibilities
+
+Community leaders are responsible for clarifying and enforcing our standards of acceptable behavior and will take appropriate and fair corrective action in response to any behavior that they deem inappropriate, threatening, offensive, or harmful.
+
+Community leaders have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, and will communicate reasons for moderation decisions when appropriate.
+
+## Scope
+
+This Code of Conduct applies within all community spaces, and also applies when an individual is officially representing the community in public spaces. Examples of representing our community include using an official e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be reported to the community leaders responsible for enforcement at lev.pruglo@mail.ru. All complaints will be reviewed and investigated promptly and fairly.
+
+All community leaders are obligated to respect the privacy and security of the reporter of any incident.
+
+## Enforcement Guidelines
+
+Community leaders will follow these Community Impact Guidelines in determining the consequences for any action they deem in violation of this Code of Conduct:
+
+### 1. Correction
+
+**Community Impact**: Use of inappropriate language or other behavior deemed unprofessional or unwelcome in the community.
+
+**Consequence**: A private, written warning from community leaders, providing clarity around the nature of the violation and an explanation of why the behavior was inappropriate. A public apology may be requested.
+
+### 2. Warning
+
+**Community Impact**: A violation through a single incident or series of actions.
+
+**Consequence**: A warning with consequences for continued behavior. No interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, for a specified period of time. This includes avoiding interactions in community spaces as well as external channels like social media. Violating these terms may lead to a temporary or permanent ban.
+
+### 3. Temporary Ban
+
+**Community Impact**: A serious violation of community standards, including sustained inappropriate behavior.
+
+**Consequence**: A temporary ban from any sort of interaction or public communication with the community for a specified period of time. No public or private interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, is allowed during this period. Violating these terms may lead to a permanent ban.
+
+### 4. Permanent Ban
+
+**Community Impact**: Demonstrating a pattern of violation of community standards, including sustained inappropriate behavior,  harassment of an individual, or aggression toward or disparagement of classes of individuals.
+
+**Consequence**: A permanent ban from any sort of public interaction within the community.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 2.0,
+available at https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
+
+Community Impact Guidelines were inspired by [Mozilla's code of conduct enforcement ladder](https://github.com/mozilla/diversity).
+
+[homepage]: https://www.contributor-covenant.org
+
+For answers to common questions about this code of conduct, see the FAQ at
+https://www.contributor-covenant.org/faq. Translations are available at https://www.contributor-covenant.org/translations.

data/Gemfile

@@ -0,0 +1,20 @@
+# frozen_string_literal: true
+
+source "https://rubygems.org"
+
+gemspec
+
+gem "rake", "~> 13.0"
+
+gem "matrix"
+
+group :development, :test do
+  gem "byebug"
+  gem "rspec"
+  gem "rubocop", require: false
+  gem "rubocop-performance", require: false
+  gem "rubocop-rake", require: false
+  gem "rubocop-rspec", require: false
+  gem "rubycritic", require: false
+  gem "simplecov", require: false
+end

data/Gemfile.lock

@@ -0,0 +1,143 @@
+PATH
+  remote: .
+  specs:
+    ropt (1.0.0)
+      matrix
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    addressable (2.8.6)
+      public_suffix (>= 2.0.2, < 6.0)
+    ast (2.4.2)
+    axiom-types (0.1.1)
+      descendants_tracker (~> 0.0.4)
+      ice_nine (~> 0.11.0)
+      thread_safe (~> 0.3, >= 0.3.1)
+    byebug (11.1.3)
+    coercible (1.0.0)
+      descendants_tracker (~> 0.0.1)
+    descendants_tracker (0.0.4)
+      thread_safe (~> 0.3, >= 0.3.1)
+    diff-lcs (1.5.0)
+    docile (1.4.0)
+    erubi (1.12.0)
+    flay (2.13.1)
+      erubi (~> 1.10)
+      path_expander (~> 1.0)
+      ruby_parser (~> 3.0)
+      sexp_processor (~> 4.0)
+    flog (4.8.0)
+      path_expander (~> 1.0)
+      ruby_parser (~> 3.1, > 3.1.0)
+      sexp_processor (~> 4.8)
+    ice_nine (0.11.2)
+    json (2.7.1)
+    kwalify (0.7.2)
+    language_server-protocol (3.17.0.3)
+    launchy (2.5.2)
+      addressable (~> 2.8)
+    matrix (0.4.2)
+    parallel (1.23.0)
+    parser (3.2.2.4)
+      ast (~> 2.4.1)
+      racc
+    path_expander (1.1.1)
+    public_suffix (5.0.4)
+    racc (1.7.3)
+    rainbow (3.1.1)
+    rake (13.1.0)
+    reek (6.1.4)
+      kwalify (~> 0.7.0)
+      parser (~> 3.2.0)
+      rainbow (>= 2.0, < 4.0)
+    regexp_parser (2.8.3)
+    rexml (3.2.6)
+    rspec (3.12.0)
+      rspec-core (~> 3.12.0)
+      rspec-expectations (~> 3.12.0)
+      rspec-mocks (~> 3.12.0)
+    rspec-core (3.12.2)
+      rspec-support (~> 3.12.0)
+    rspec-expectations (3.12.3)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.12.0)
+    rspec-mocks (3.12.6)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.12.0)
+    rspec-support (3.12.1)
+    rubocop (1.59.0)
+      json (~> 2.3)
+      language_server-protocol (>= 3.17.0)
+      parallel (~> 1.10)
+      parser (>= 3.2.2.4)
+      rainbow (>= 2.2.2, < 4.0)
+      regexp_parser (>= 1.8, < 3.0)
+      rexml (>= 3.2.5, < 4.0)
+      rubocop-ast (>= 1.30.0, < 2.0)
+      ruby-progressbar (~> 1.7)
+      unicode-display_width (>= 2.4.0, < 3.0)
+    rubocop-ast (1.30.0)
+      parser (>= 3.2.1.0)
+    rubocop-capybara (2.19.0)
+      rubocop (~> 1.41)
+    rubocop-factory_bot (2.24.0)
+      rubocop (~> 1.33)
+    rubocop-performance (1.19.1)
+      rubocop (>= 1.7.0, < 2.0)
+      rubocop-ast (>= 0.4.0)
+    rubocop-rake (0.6.0)
+      rubocop (~> 1.0)
+    rubocop-rspec (2.25.0)
+      rubocop (~> 1.40)
+      rubocop-capybara (~> 2.17)
+      rubocop-factory_bot (~> 2.22)
+    ruby-progressbar (1.13.0)
+    ruby_parser (3.20.3)
+      sexp_processor (~> 4.16)
+    rubycritic (4.9.0)
+      flay (~> 2.13)
+      flog (~> 4.7)
+      launchy (>= 2.5.2)
+      parser (>= 3.2.2.1)
+      rainbow (~> 3.1.1)
+      reek (~> 6.0, < 7.0)
+      rexml
+      ruby_parser (~> 3.20)
+      simplecov (>= 0.22.0)
+      tty-which (~> 0.5.0)
+      virtus (~> 2.0)
+    sexp_processor (4.17.0)
+    simplecov (0.22.0)
+      docile (~> 1.1)
+      simplecov-html (~> 0.11)
+      simplecov_json_formatter (~> 0.1)
+    simplecov-html (0.12.3)
+    simplecov_json_formatter (0.1.4)
+    thread_safe (0.3.6)
+    tty-which (0.5.0)
+    unicode-display_width (2.5.0)
+    virtus (2.0.0)
+      axiom-types (~> 0.1)
+      coercible (~> 1.0)
+      descendants_tracker (~> 0.0, >= 0.0.3)
+
+PLATFORMS
+  x86_64-darwin-21
+  x86_64-linux
+
+DEPENDENCIES
+  byebug
+  matrix
+  rake (~> 13.0)
+  ropt!
+  rspec
+  rubocop
+  rubocop-performance
+  rubocop-rake
+  rubocop-rspec
+  rubycritic
+  simplecov
+
+BUNDLED WITH
+   2.5.6

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2023 Lev Pruglo 
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,86 @@
+# Ropt
+
+The library for mathematical optimization in Ruby is designed to help solve many problems in the computational, financial, social, and energy fields and, in theory, should include components of game theory, combinatorics, probability theory, linear and nonlinear optimization, cluster, regression, and other analysis.
+
+At the moment, it is a simple library for working with some types of [Antagonistic](https://en.wikipedia.org/wiki/Zero-sum_game) and [Cooperative](https://en.wikipedia.org/wiki/Cooperative_game_theory) Games described in game theory.
+Solvers have been written to calculate the lower and upper values of the [Matrix Game](https://en.wikipedia.org/wiki/Normal-form_game), indicating whether there is a Nash equilibrium.
+A solver for calculating the [Shapley Vector](https://en.wikipedia.org/wiki/Shapley_value) has been implemented for the cooperative part of game theory.
+
+## Installation
+
+Adding to a gem:
+
+`gem install ropt`
+
+Or adding to your project:
+
+`gem "ropt", "~> 1.0"`
+
+Run bundle install: 
+
+`bundle install`
+
+## Usage
+
+To call the matrix game solver, you need to do:
+
+```
+strategies = [[2, 1], [2, 0]]
+Ropt::AntagonisticGames::MatrixGame.new(strategies).solve
+```
+
+In this example, the result will be:
+```
+{
+   :first_gamer_optimal_strategy=>[2, 1], 
+   :second_gamer_optimal_strategy=>[1, 0], 
+   :lower_value=>1, 
+   :higher_value=>1, 
+   :equilibrium=>true
+}
+```
+
+For large arrays, there may be a memory limit, which leads to a slowdown in the operation of the method.
+
+Consider an example using a solver to calculate the Shapley Vector. 
+
+The call looks like this:
+```
+coalitions = {
+               B: 0,
+               A: 0,
+               AB: 1,
+               C: 0,
+               ABC: 1,
+               AC: 1 
+              }
+               
+number_gamers = 3
+
+Ropt::CooperativeGames::ShapleyValue.new(coalitions, number_gamers).solve
+```
+
+In this example, the result of Shapley Value will be:
+
+```
+{
+   :B=>0.167, 
+   :A=>0.667, 
+   :C=>0.167
+}
+```
+It is worth noting that coalitions and the number of gamers must be sent, otherwise a validation error will occur.
+If it is determined that the value of the grand coalition characteristic function is not equal to the sum of the components of the Shapley Vector, the solver will raise an exception.
+
+The constant defines an upper limit for the number of gamers, which is 171 gamers. Exceeding this number will result in an exception being raised.
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/Leozack-red/ropt. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [code of conduct](https://github.com/[USERNAME]/ropt/blob/main/CODE_OF_CONDUCT.md).
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
+
+## Code of Conduct
+
+Everyone interacting in the Ropt project's codebases, issue trackers, chat rooms and mailing lists is expected to follow the [code of conduct](https://github.com/[USERNAME]/ropt/blob/main/CODE_OF_CONDUCT.md).

data/Rakefile

@@ -0,0 +1,12 @@
+# frozen_string_literal: true
+
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+
+require "rubocop/rake_task"
+
+RuboCop::RakeTask.new
+
+task default: %i[spec rubocop]

data/lib/ropt/antagonistic_games/matrix_game.rb

@@ -0,0 +1,69 @@
+# frozen_string_literal: true
+
+require "ropt/vector_matrix_math/shell_matrix"
+
+module Ropt
+  module AntagonisticGames
+    # class for matrix game solver with option of get report string message
+    class MatrixGame
+      attr_accessor :matrix, :count_rows, :count_columns
+
+      def initialize(rows)
+        @matrix = Ropt::VectorMatrixMath::ShellMatrix.create(rows)
+        @count_rows = rows.size
+        @count_columns = rows.first.size
+      end
+
+      def solve
+        hash_result
+      end
+
+      private
+
+      def hash_result
+        {
+          first_gamer_optimal_strategy: opt_strategy(:first),
+          second_gamer_optimal_strategy: opt_strategy(:second),
+          lower_value:,
+          higher_value:,
+          equilibrium: lower_value == higher_value
+        }
+      end
+
+      def opt_strategy(gamer_position)
+        case gamer_position
+        when :first
+          index = find_vector(:row).index(lower_value)
+          matrix.row(index).to_a
+        when :second
+          index = find_vector(:column).index(higher_value)
+          matrix.column(index).to_a
+        end
+      end
+
+      def lower_value
+        find_vector(:row).max
+      end
+
+      def higher_value
+        find_vector(:column).min
+      end
+
+      def find_vector(vector)
+        case vector
+        when :row
+          (0...count_rows).map { |number| find_extremum(number, :min) }
+        when :column
+          (0...count_columns).map { |number| find_extremum(number, :max) }
+        end
+      end
+
+      def find_extremum(number, direction)
+        case direction
+        when :min then matrix.row(number).min
+        when :max then matrix.column(number).max
+        end
+      end
+    end
+  end
+end

data/lib/ropt/cooperative_games/coalitions_coefficients.rb

@@ -0,0 +1,41 @@
+# frozen_string_literal: true
+
+module Ropt
+  module CooperativeGames
+    # class for get coefficients of Shapley Value with limit of number of gamers equal 171
+    class CoalitionsCoefficients
+      attr_accessor :number_gamers
+
+      LIMIT_VALUE = 171
+
+      def initialize(number_gamers)
+        @number_gamers = number_gamers.to_f
+      end
+
+      def call
+        validate_number
+        coefficients if number_gamers == coefficients.size
+      end
+
+      private
+
+      def coefficients
+        (0...number_gamers).map do |coalition_power|
+          numerator = factorial(coalition_power) * factorial(number_gamers - coalition_power - 1)
+          numerator.to_f / factorial(number_gamers)
+        end
+      end
+
+      def factorial(number)
+        (1..number).inject(1, :*)
+      end
+
+      def validate_number
+        return unless number_gamers >= LIMIT_VALUE
+
+        raise Error,
+              "The gamers is #{LIMIT_VALUE} or more. You should reduce the number of gamers"
+      end
+    end
+  end
+end

data/lib/ropt/cooperative_games/shapley_value.rb

@@ -0,0 +1,79 @@
+# frozen_string_literal: true
+
+module Ropt
+  module CooperativeGames
+    # class for calculating of Shapley Value something super-additive convex cooperative game
+    class ShapleyValue
+      attr_accessor :coalitions, :number_gamers, :coefficients, :validator, :round
+
+      DEFAULT_VALUE_OF_COALITION = 0
+      def initialize(coalitions, number_gamers, round = 3)
+        @coalitions = coalitions
+        @number_gamers = number_gamers
+        @coefficients = Ropt::CooperativeGames::CoalitionsCoefficients.new(number_gamers).call
+        @validator = Ropt::CooperativeGames::Validator.new
+        @round = round
+      end
+
+      def solve
+        validator.validate_arguments(coefficients,
+                                     coalitions,
+                                     number_gamers)
+
+        singletons = singleton_coalitions
+
+        validator.validate_coalitions_consistency(coalitions, singletons.keys)
+
+        vector = calculate_vector_shapley(singletons)
+
+        validator.validate_result(coalitions, singletons.keys, vector)
+
+        vector
+      end
+
+      private
+
+      def singleton_coalitions
+        coalitions.select { |key, _value| key.size == 1 }
+      end
+
+      def calculate_vector_shapley(singletons)
+        vector = singletons.each_with_object({}) do |singleton, result|
+          name_gamer = singleton.first
+          coalitions_with_gamer = coalitions_with_gamer(name_gamer)
+
+          result.merge!(shapley_value_for_one_gamer(name_gamer, coalitions_with_gamer))
+        end
+
+        aggregate_components(vector)
+      end
+
+      def shapley_value_for_one_gamer(name_gamer, coalitions_with_gamer)
+        cost_gamer = coalitions_with_gamer.flat_map do |coalition, value|
+          if coalition.size == 1
+            coefficients[0] * value
+          else
+            coefficients[coalition.size - 1] * (value - value_coalition_without_gamer(coalition, name_gamer))
+          end
+        end
+
+        { name_gamer => cost_gamer }
+      end
+
+      def aggregate_components(vector)
+        vector.transform_values { |component| component.sum.round(round) }
+      end
+
+      def value_coalition_without_gamer(coalition, name_gamer)
+        value = coalitions[coalition.to_s.delete(name_gamer.to_s).to_sym]
+        return value unless value.nil?
+
+        DEFAULT_VALUE_OF_COALITION
+      end
+
+      def coalitions_with_gamer(name_gamer)
+        coalitions.select { |key, _value| key.to_s.include?(name_gamer.to_s) }
+      end
+    end
+  end
+end

data/lib/ropt/cooperative_games/validator.rb

@@ -0,0 +1,63 @@
+# frozen_string_literal: true
+
+module Ropt
+  module CooperativeGames
+    # class for validation after and before calculating vector shapley
+    class Validator
+      def validate_arguments(coefficients, coalitions, number_gamers)
+        validate_number_gamers(number_gamers)
+        validate_coalitions(coalitions)
+        validate_coefficients(coefficients)
+      end
+
+      def validate_coalitions_consistency(coalitions, names_singletons)
+        value_grand_coalition = value_grand_coalition(coalitions, names_singletons)
+        validate_value_grand_coalition(value_grand_coalition)
+      end
+
+      def validate_result(coalitions, names_singletons, vector)
+        value_grand_coalition = value_grand_coalition(coalitions, names_singletons)
+        validate_vector(value_grand_coalition, vector)
+      end
+
+      private
+
+      def validate_coefficients(coefficients)
+        raise Error, "Not find coefficients" if coefficients.nil? || coefficients.empty?
+      end
+
+      def validate_coalitions(coalitions)
+        raise Error, "Not find coalitions" if coalitions.nil? || coalitions.empty?
+      end
+
+      def validate_number_gamers(number_gamers)
+        raise Error, "Not find number of gamers" if number_gamers.nil?
+      end
+
+      def value_grand_coalition(coalitions, names_singletons)
+        most_big_coalition = coalitions.keys.max_by(&:length)
+        most_big_coalition_by_singles = coalitions.select do |coalition|
+          coalition.size == names_singletons.count
+        end
+
+        return nil if most_big_coalition != most_big_coalition_by_singles.keys.first
+
+        most_big_coalition_by_singles.values.first
+      end
+
+      def validate_value_grand_coalition(value)
+        return if value
+
+        raise Error,
+              "Not find value of grand coalition or several singletons coalitions"
+      end
+
+      def validate_vector(value_grand_coalition, vector)
+        return if vector.values.sum.round(2) == value_grand_coalition.to_f.round(2)
+
+        raise Error,
+              "Sum components of Shapley vector is not equal value of grand coalition"
+      end
+    end
+  end
+end

data/lib/ropt/vector_matrix_math/operation_vectors.rb

@@ -0,0 +1,22 @@
+# frozen_string_literal: true
+
+require "matrix"
+require "ropt/vector_matrix_math/shell_vector"
+
+module Ropt
+  module VectorMatrixMath
+    # class-wrapper for converting arrays to objects of vectors with option of inner product
+    class OperationVectors
+      attr_accessor :vector1, :vector2
+
+      def initialize(vector1, vector2)
+        @vector1 = ShellVector.create(vector1)
+        @vector2 = ShellVector.create(vector2)
+      end
+
+      def inner_product
+        vector1.inner_product(vector2)
+      end
+    end
+  end
+end

data/lib/ropt/vector_matrix_math/shell_matrix.rb

@@ -0,0 +1,14 @@
+# frozen_string_literal: true
+
+require "matrix"
+
+module Ropt
+  module VectorMatrixMath
+    # class-wrapper for converting vectors objects to matrix
+    class ShellMatrix
+      def self.create(rows)
+        Matrix.send(:new, rows)
+      end
+    end
+  end
+end

data/lib/ropt/vector_matrix_math/shell_vector.rb

@@ -0,0 +1,14 @@
+# frozen_string_literal: true
+
+require "matrix"
+
+module Ropt
+  module VectorMatrixMath
+    # class-wrapper for converting numerics objects to vector
+    class ShellVector < Vector
+      def self.create(components_vector)
+        Vector.send(:new, components_vector)
+      end
+    end
+  end
+end

data/lib/ropt/version.rb

@@ -0,0 +1,5 @@
+# frozen_string_literal: true
+
+module Ropt
+  VERSION = "1.0.0"
+end

data/lib/ropt.rb

@@ -0,0 +1,14 @@
+# frozen_string_literal: true
+
+require_relative "ropt/version"
+
+# module for integrate all solvers of optimization problems
+module Ropt
+  class Error < StandardError; end
+
+  require_relative "ropt/vector_matrix_math/operation_vectors"
+  require_relative "ropt/antagonistic_games/matrix_game"
+  require_relative "ropt/cooperative_games/coalitions_coefficients"
+  require_relative "ropt/cooperative_games/shapley_value"
+  require_relative "ropt/cooperative_games/validator"
+end

data/ropt.gemspec

@@ -0,0 +1,41 @@
+# frozen_string_literal: true
+
+require_relative "lib/ropt/version"
+
+Gem::Specification.new do |spec|
+  spec.name = "ropt"
+  spec.version = Ropt::VERSION
+  spec.authors = ["Lev Pruglo "]
+  spec.email = ["lev.pruglo@mail.ru"]
+
+  spec.summary = "Library for mathematical optimization"
+  spec.description = "The library for mathematical optimization in Ruby is designed to help solve many problems in the
+                      computational, financial, social, and energy fields and, in theory,
+                      should include components of game theory, combinatorics, probability theory,
+                      linear and nonlinear optimization, cluster, regression, and other analysis."
+  spec.homepage = "https://github.com/Leozack-red"
+  spec.license = "MIT"
+  spec.required_ruby_version = ">= 2.7.0"
+  spec.metadata = { "rubygems_mfa_required" => "true" }
+  spec.metadata["homepage_uri"] = spec.homepage
+  spec.metadata["source_code_uri"] = "https://github.com/Leozack-red/ropt"
+  spec.metadata["changelog_uri"] = "https://github.com/Leozack-red/ropt/blob/master/CHANGELOG.md"
+
+  # Specify which files should be added to the gem when it is released.
+  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
+  spec.files = Dir.chdir(__dir__) do
+    `git ls-files -z`.split("\x0").reject do |f|
+      (File.expand_path(f) == __FILE__) || f.start_with?(*%w[bin/ test/ spec/ features/ .git .circleci appveyor])
+    end
+  end
+  spec.bindir = "exe"
+  spec.executables = spec.files.grep(%r{\Aexe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+  spec.extra_rdoc_files = ["README.md"]
+
+  spec.add_dependency "matrix"
+
+  # For more information and examples about making a new gem, check out our
+  # guide at: https://bundler.io/guides/creating_gem.html
+  spec.metadata["rubygems_mfa_required"] = "true"
+end

data/sig/ropt.rbs

@@ -0,0 +1,4 @@
+module Ropt
+  VERSION: String
+  # See the writing guide of rbs: https://github.com/ruby/rbs#guides
+end

metadata

@@ -0,0 +1,86 @@
+--- !ruby/object:Gem::Specification
+name: ropt
+version: !ruby/object:Gem::Version
+  version: 1.0.0
+platform: ruby
+authors:
+- 'Lev Pruglo '
+autorequire:
+bindir: exe
+cert_chain: []
+date: 2024-02-19 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: matrix
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+description: |-
+  The library for mathematical optimization in Ruby is designed to help solve many problems in the
+                        computational, financial, social, and energy fields and, in theory,
+                        should include components of game theory, combinatorics, probability theory,
+                        linear and nonlinear optimization, cluster, regression, and other analysis.
+email:
+- lev.pruglo@mail.ru
+executables: []
+extensions: []
+extra_rdoc_files:
+- README.md
+files:
+- ".rspec"
+- ".rubocop.yml"
+- CHANGELOG.md
+- CODE_OF_CONDUCT.md
+- Gemfile
+- Gemfile.lock
+- LICENSE.txt
+- README.md
+- Rakefile
+- lib/ropt.rb
+- lib/ropt/antagonistic_games/matrix_game.rb
+- lib/ropt/cooperative_games/coalitions_coefficients.rb
+- lib/ropt/cooperative_games/shapley_value.rb
+- lib/ropt/cooperative_games/validator.rb
+- lib/ropt/vector_matrix_math/operation_vectors.rb
+- lib/ropt/vector_matrix_math/shell_matrix.rb
+- lib/ropt/vector_matrix_math/shell_vector.rb
+- lib/ropt/version.rb
+- ropt.gemspec
+- sig/ropt.rbs
+homepage: https://github.com/Leozack-red
+licenses:
+- MIT
+metadata:
+  rubygems_mfa_required: 'true'
+  homepage_uri: https://github.com/Leozack-red
+  source_code_uri: https://github.com/Leozack-red/ropt
+  changelog_uri: https://github.com/Leozack-red/ropt/blob/master/CHANGELOG.md
+post_install_message:
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 2.7.0
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.5.6
+signing_key:
+specification_version: 4
+summary: Library for mathematical optimization
+test_files: []