32 citations · 85 across the 18 of their papers we have counts for
7 papers · 1 filter
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
Igor Konnov, Marijana Lazić, Ilina Stoilkovska +1
Threshold guards are a basic primitive of many fault-tolerant algorithms that solve classical problems in distributed computing, such as reliable broadcast, two-phase commit, and c…
A Tendermint Light Client
Sean Braithwaite, Ethan Buchman, Ismail Khoffi +4
In Tendermint blockchains, the proof-of-stake mechanism and the underlying consensus algorithm entail a dynamic fault model that implies that the active validators (nodes that sign…
Exact Penalties for Decomposable Optimization Problems
Igor V. Konnov
We consider a general decomposable convex optimization problem. By using right-hand side allocation technique, it can be transformed into a collection of small dimensional optimiza…
Decentralized Multi-Agent Optimization Based on a Penalty Method
Igor Konnov
We propose a decentralized penalty method for general convex constrained multi-agent optimization problems. Each auxiliary penalized problem is solved approximately with a special…
Variational Inequality Type Formulations of General Market Equilibrium Problems with Local Information
Igor Konnov
We suggest a new approach to creation of general market equilibrium models involving economic agents with local and partial knowledge about the system and under different restricti…
A little about models
I. V. Konnov
We discuss several aspects of creation of adequate mathematical models in other sciences. In particular, many difficulties stem from great complexity of the source systems and the…
A General Class of Relative Optimization Problems
I. V. Konnov
We consider relative or subjective optimization problems where the goal function and feasible set are dependent of the current state of the system under consideration. In general,…