FTS Solver

This package defines a few basic types and a solver interface to operate over these types. Presently, the following solvers are provided:

• feature = ["clarabel"] -- Uses the Clarabel interior point solver for the quadratic program
• feature = ["osqp"] -- Uses the OSQP ADMM solver for the quadratic program

Additional solvers will be developed as needed. The present implementations are intended as "reference" for future work.

Primitive Types

There are two externally-defined types ProductId and AuthId, which allow the application host to provide their own implementations. These are black-boxes as far as the solver is concerned -- they just need to implement Clone + Eq + Hash + Ord.

This crate defines a Submission<AuthId, ProductId> type, which is intended to encapsulate a single bidder's submission. A submission is a combination of auths and costs: an auth defines a portfolio (a sparse vector over product space) and the minimum and maximum allowable trade of this portfolio. Costs define a linear combination of auths (a group) and a utility function, whose domain additionally constrains the space of feasible outcomes. It is assumed by the solver that auth ids are globally unique; that is, the auth ids should be disjointly partitioned amongst the submissions. (It does not otherwise cause an error, but will likely yield unexpected results.) Refer to the implementations of src/types/auth.rs and src/types/cost.rs for more details on these types. Refer to tests/simple_solve.rs for an example assembling two submissions and solving them.

TODO

• Warm-start interface
• Large-scale tests
• Enhanced dual reporting
• Automatic determination of error tolerances based on input
• Bespoke ADMM implementation