Maintenance in single-server queues: a game-theoretic approach.
Market clearing price and equilibria of the progressive second price mechanism
The Progressive Second Price mechanism (PSP), recently introduced by Lazar and Semret to share an infinitely-divisible resource among users through pricing, has been shown to verify very interesting properties. Indeed, the incentive compatibility property of that scheme, and the convergence to an efficient resource allocation where established, using the framework of Game Theory. Therefore, that auction-based allocation and pricing scheme seems particularly well-suited to solve congestion problems...
Markov stopping games with an absorbing state and total reward criterion
This work is concerned with discrete-time zero-sum games with Markov transitions on a denumerable space. At each decision time player II can stop the system paying a terminal reward to player I, or can let the system to continue its evolution. If the system is not halted, player I selects an action which affects the transitions and receives a running reward from player II. Assuming the existence of an absorbing state which is accessible from any other state, the performance of a pair of decision...
Mathematical modelling of information age conflict.
Maximal elements and equilibria of generalized games for -majorized and condensing correspondences.
Method of construction of the evasion strategy for differential games with many pursuers [Book]
Metrizable groups and strict o-boundedness
Min, a combinatorial game having a connection with prime numbers.
Minimal predictors in hat problems
We consider a combinatorial problem related to guessing the values of a function at various points based on its values at certain other points, often presented by way of a hat-problem metaphor: there are a number of players who will have colored hats placed on their heads, and they wish to guess the colors of their own hats. A visibility relation specifies who can see which hats. This paper focuses on the existence of minimal predictors: strategies guaranteeing at least one player guesses correctly,...
Minimax Theory with Transversal Points
Minimaxtheoreme und das Integraldarstellungsproblem.
Mixed complementarity problems for robust optimization equilibrium in bimatrix game
In this paper, we investigate the bimatrix game using the robust optimization approach, in which each player may neither exactly estimate his opponent’s strategies nor evaluate his own cost matrix accurately while he may estimate a bounded uncertain set. We obtain computationally tractable robust formulations which turn to be linear programming problems and then solving a robust optimization equilibrium can be converted to solving a mixed complementarity problem under the -norm. Some numerical...
Modeling and simulation with augmented reality
In applications such as airport operations, military simulations, and medical simulations, conducting simulations in accurate and realistic settings that are represented by real video imaging sequences becomes essential. This paper surveys recent work that enables visually realistic model constructions and the simulation of synthetic objects which are inserted in video sequences, and illustrates how synthetic objects can conduct intelligent behavior within a visual augmented reality.
Modeling and simulation with augmented reality
In applications such as airport operations, military simulations, and medical simulations, conducting simulations in accurate and realistic settings that are represented by real video imaging sequences becomes essential. This paper surveys recent work that enables visually realistic model constructions and the simulation of synthetic objects which are inserted in video sequences, and illustrates how synthetic objects can conduct intelligent behavior within a visual augmented reality.
Modeling shortest path games with Petri nets: a Lyapunov based theory
In this paper we introduce a new modeling paradigm for shortest path games representation with Petri nets. Whereas previous works have restricted attention to tracking the net using Bellman's equation as a utility function, this work uses a Lyapunov-like function. In this sense, we change the traditional cost function by a trajectory-tracking function which is also an optimal cost-to-target function. This makes a significant difference in the conceptualization of the problem domain, allowing the...
Monotone extenders for bounded c-valued functions
Let c be the Banach space consisting of all convergent sequences of reals with the sup-norm, the set of all bounded continuous functions f: A → c, and the set of all functions f: X → c which are continuous at each point of A ⊂ X. We show that a Tikhonov subspace A of a topological space X is strong Choquet in X if there exists a monotone extender . This shows that the monotone extension property for bounded c-valued functions can fail in GO-spaces, which provides a negative answer to a question...
Motion planning in cartesian product graphs
Let G be an undirected graph with n vertices. Assume that a robot is placed on a vertex and n − 2 obstacles are placed on the other vertices. A vertex on which neither a robot nor an obstacle is placed is said to have a hole. Consider a single player game in which a robot or obstacle can be moved to adjacent vertex if it has a hole. The objective is to take the robot to a fixed destination vertex using minimum number of moves. In general, it is not necessary that the robot will take a shortest path...
Mr. Paint and Mrs. Correct.
Multi-agent avoidance control using an -matrix property.
Multidimensional assignment: applications and some thoughts.