Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Claudia Calabrese
Gabriel Marzinotto
Zheng-Chu Guo
Pamela Tröndle
Jhonathan Pinzon
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
JULIO B. CLEMPNER
Author Info
Open Visualization
Name
Affiliation
Papers
JULIO B. CLEMPNER
Ctr Comp Res, Natl Polytechn Inst, Ave Juan Dios Batiz s n,Edificio CIC,Col Nueva In, Mexico City 07738, DF, Mexico
52
Collaborators
Citations
PageRank
21
91
20.11
Referers
Referees
References
53
655
448
Search Limit
100
655
Publications (52 rows)
Collaborators (21 rows)
Referers (53 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Computing the Nash Bargaining Solution for Multiple Players in Discrete-Time Markov Chains Games
0
0.34
2020
Finding the Strong Nash Equilibrium: Computation, Existence and Characterization for Markov Games
0
0.34
2020
Repeated Stackelberg Security Games: Learning with Incomplete State Information
1
0.35
2020
Traffic-signal control reinforcement learning approach for continuous-time Markov games.
0
0.34
2020
A nucleus for Bayesian Partially Observable Markov Games: Joint observer and mechanism design
0
0.34
2020
Continuous-time gradient-like descent algorithm for constrained convex unknown functions: Penalty method application.
0
0.34
2019
A Stackelberg security Markov game based on partial information for strategic decision making against unexpected attacks
1
0.35
2019
Controller exploitation-exploration reinforcement learning architecture for computing near-optimal policies
1
0.35
2019
Continuous-time reinforcement learning approach for portfolio management with time penalization
1
0.35
2019
Continuous-Time Mean Variance Portfolio With Transaction Costs: A Proximal Approach Involving Time Penalization
0
0.34
2019
Solving traffic queues at controlled-signalized intersections in continuous-time Markov games.
0
0.34
2019
Observer and control design in partially observable finite Markov chains.
0
0.34
2019
DC Motor Control based on Robust run-time Optimization Algorithm
0
0.34
2019
A team formation method based on a Markov chains games approach.
0
0.34
2019
Robust Extremum Seeking For A Second Order Uncertain Plant Using A Sliding Mode Controller
0
0.34
2019
Using The Manhattan Distance For Computing The Multiobjective Markov Chains Problem
0
0.34
2018
On Lyapunov Game Theory Equilibrium: Static And Dynamic Approaches
0
0.34
2018
Computing multiobjective Markov chains handled by the extraproximal method.
1
0.38
2018
A Tikhonov regularized penalty function approach for solving polylinear programming problems.
2
0.37
2018
Continuous-Time Extremum Seeking with Function Measurements Disturbed by Stochastic Noise: A Synchronous Detection Approach
2
0.39
2018
Measuring the emotional state among interacting agents: A game theory approach using reinforcement learning.
1
0.37
2018
Solving Stackelberg security Markov games employing the bargaining Nash approach: Convergence analysis.
1
0.35
2018
Constrained Extremum Seeking with Function Measurements Disturbed by Stochastic Noise
2
0.39
2018
A Reinforcement Learning Approach For Solving The Mean Variance Customer Portfolio In Partially Observable Models
0
0.34
2018
A Continuous-Time Markov Stackelberg Security Game Approach For Reasoning About Real Patrol Strategies
4
0.41
2018
Strategic Manipulation Approach for Solving Negotiated Transfer Pricing Problem.
2
0.38
2018
Adapting attackers and defenders patrolling strategies: A reinforcement learning approach for Stackelberg security games.
3
0.38
2018
Classical workflow nets and workflow nets with reset arcs: using Lyapunov stability for soundness verification.
0
0.34
2017
Fast Terminal Sliding-Mode Control With an Integral Filter Applied to a Van Der Pol Oscillator.
2
0.38
2017
Multiobjective Markov chains optimization problem with strong Pareto frontier: Principles of decision making.
3
0.40
2017
Using the extraproximal method for computing the shortest-path mixed Lyapunov equilibrium in Stackelberg security games.
6
0.53
2017
A Game Theory Model for Manipulation Based on Machiavellianism: Moral and Ethical Behavior.
3
0.46
2017
An iterative method for solving stackelberg security games: A Markov games approach
1
0.35
2017
Negotiating transfer pricing using the Nash bargaining solution
3
0.45
2017
Conforming coalitions in Markov Stackelberg security games: Setting max cooperative defenders vs. non-cooperative attackers.
0
0.34
2016
Adapting Strategies To Dynamic Environments In Controllable Stackelberg Security Games
0
0.34
2016
An optimal strong equilibrium solution for cooperative multi-leader-follower Stackelberg Markov chains games.
3
0.41
2016
Necessary and sufficient Karush-Kuhn-Tucker conditions for multiobjective Markov chains optimality.
5
0.50
2016
Modeling Multileader–Follower Noncooperative Stackelberg Games
3
0.43
2016
Convergence analysis for pure stationary strategies in repeated potential games: Nash, Lyapunov and correlated equilibria
1
0.35
2016
Solving the Pareto front for multiobjective Markov chains using the minimum Euclidean distance gradient-based optimization method
6
0.51
2016
Solving the mean-variance customer portfolio in Markov chains using iterated quadratic/Lagrange programming: A credit-card customer limits approach.
0
0.34
2015
A priori-knowledge/actor-critic reinforcement learning architecture for computing the mean–variance customer portfolio: The case of bank marketing campaigns
1
0.35
2015
Solving the multi-traffic signal-control problem for a class of continuous-time markov games
0
0.34
2015
Computing The Stackelberg/Nash Equilibria Using The Extraproximal Method: Convergence Analysis And Implementation Details For Markov Chains Games
14
0.76
2015
A Stackelberg security game with random strategies based on the extraproximal theoretic approach.
9
0.68
2015
Setting Cournot Versus Lyapunov Games Stability Conditions And Equilibrium Point Properties
2
0.41
2015
Computing the Lp-strong nash equilibrium looking for cooperative stability in multiple agents markov games
0
0.34
2015
Stackelberg security games: Computing the shortest-path equilibrium.
5
0.46
2015
Computing The Strong Nash Equilibrium For Markov Chains Games
2
0.41
2015
1
2
50 / page