11,258 research outputs found
Algorithms for generalized potential games with mixed-integer variables
We consider generalized potential games, that constitute a fundamental subclass of generalized Nash equilibrium problems. We propose different methods to compute solutions of generalized potential games with mixed-integer variables, i.e., games in which some variables are continuous while the others are discrete. We investigate which types of equilibria of the game can be computed by minimizing a potential function over the common feasible set. In particular, for a wide class of generalized potential games, we characterize those equilibria that can be computed by minimizing potential functions as Pareto solutions of a particular multi-objective problem, and we show how different potential functions can be used to select equilibria. We propose a new Gauss–Southwell algorithm to compute approximate equilibria of any generalized potential game with mixed-integer variables. We show that this method converges in a finite number of steps and we also give an upper bound on this number of steps. Moreover, we make a thorough analysis on the behaviour of approximate equilibria with respect to exact ones. Finally, we make many numerical experiments to show the viability of the proposed approaches
Erratum to the paper "A note on the factorization theorem of toric birational maps after Morelli and its toroidal extension"
This is an erratum to math.AG/9803126, Tohoku 51 (1999) 489-537. This erratum
describes:
1. the failure of the algorithm in [AMR] and [Morelli1] for the strong
factorization pointed out by Kalle Karu,
2. the statement of a refined weak factorization theorem for toroidal
birational morphisms in [AMR], in the form utilized in [AKMR] for the proof of
the weak factorization theorem for general birationla maps, avoiding the use of
the above mentioned algorithm for the strong factorization, and 3. a list of
corrections for a few other mistakes in [AMR], mostly pointed out by Laurent
Bonavero.Comment: 3 page
MONAA: A Tool for Timed Pattern Matching with Automata-Based Acceleration
We present monaa, a monitoring tool over a real-time property specified by
either a timed automaton or a timed regular expression. It implements a timed
pattern matching algorithm that combines 1) features suited for online
monitoring, and 2) acceleration by automata-based skipping. Our experiments
demonstrate monaa's performance advantage, especially in online usage.Comment: Published in: 2018 IEEE Workshop on Monitoring and Testing of
Cyber-Physical Systems (MT-CPS
Quicksort with unreliable comparisons: a probabilistic analysis
We provide a probabilistic analysis of the output of Quicksort when
comparisons can err.Comment: 29 pages, 3 figure
- …