Daisuke Oyama

Efficient memory ordering for DiscreteDP

2

(This is to summarize my comments https://github.com/QuantEcon/QuantEcon.jl/pull/109#issuecomment-216474996, https://github.com/QuantEcon/QuantEcon.jl/pull/109#issuecomment-216727212, https://github.com/QuantEcon/QuantEcon.jl/pull/109#issuecomment-216764154.) - `n`: number of states - `m`: number of actions (Assume it is constant over the states) Consider `bellman_operator`, where we...

MarkovChain: Respect sparsity

1

In the current implementation of `MarkovChain`, if the input is a sparse matrix, it is converted to dense in `simulation` methods. The following is a possible approach to keeping sparsity...

MarkovChain: state_values

1

* Add a method to set `state_values` afterwards Once `mc` is created by `mc = MarkovChain(p)`, then the `state_values` field has type `UnitRange`. Currently, it is not allowed to change...

`init` should be specified as a state value? See item 2 in https://github.com/QuantEcon/QuantEcon.jl/issues/119#issue-164713096.

DiscreteDP: Should not modify s_indices and a_indices when sorting

2

``` jl julia> using QuantEcon julia> s_indices = [2, 1, 1]; # Not sorted; julia> a_indices = [1, 1, 2]; julia> R = [-1., 5, 10]; julia> Q = [0...

FIX: "The WebIO Jupyter extension was not detected"

1

* https://github.com/QuantEcon/QuantEcon.notebooks/blob/master/recursive_repeated_games.ipynb * https://nbviewer.org/github/QuantEcon/QuantEcon.notebooks/blob/master/recursive_repeated_games.ipynb See also #88, #92.