Buscar
Mostrando ítems 1-4 de 4
A branch and price algorithm for a Stackelberg Security Game
(Elsevier, 2017)
Mixed integer optimization formulations are an attractive alternative to solve Stackelberg Game problems thanks to the efficiency of state of the art mixed integer algorithms. In particular, decomposition algorithms, such ...
A study of general and security Stackelberg game formulations
(Elsevier, 2019)
In this paper, we analyze different mathematical formulations for general Stackelberg games (GSGs) and Stackelberg security games (SSGs). We consider GSGs in which a single leader commits to a utility maxi- mizing strategy ...
Game-theoretic algorithm designs and analysis for interactions among contributors in Mobile Crowdsourcing with word of mouth
(Institute of Electrical and Electronics Engineers (IEEE), 2020)
Word-of-Mouth (WoM) mode, as a new mode of task sensing in crowdsourcing, shows high efficiency in building contributor groups. To better tap the potential of WoM mobile crowdsourcing, the underlying rationale of interactions ...
Optimización binivel: nuevas perspectivas de aplicación en la planeación y control de operaciones e inventarios
(Escuela Colombiana de Ingeniería Julio GaravitoBogotá, Colombia., 2016)
La optimización binivel consiste en cambiar el paradigma de optimización tradicional, donde un solo agente selecciona su objetivo. Su principal aporte es lograr considerar la interacción que existe entre las decisiones que ...