Country: United States

Found 17049 papers in total
Robot motion planning: A game-theoretic foundation
Robot motion planning: A game-theoretic foundation
2000,
Analysis techniques and algorithms for basic path planning have become quite valuable...
Symmetry of simple games and permission of voters
Symmetry of simple games and permission of voters
2000,
In this paper, we deal with symmetry of voting situations with voters' permission. The...
A near-optimal polynomial time algorithm for learning in certain classes of stochastic games
A near-optimal polynomial time algorithm for learning in certain classes of stochastic games
2000,
We present a new algorithm for polynomial time learning of optimal behavior in...
Continuous accumulation games in continuous regions
Continuous accumulation games in continuous regions
2000,
In a continuous accumulation game on a continuous region, a Hider distributes material...
Ordinal games and generalized Nash and Stackelberg solutions
Ordinal games and generalized Nash and Stackelberg solutions
2000,
The traditional theory of cardinal games deals with problems where the players are...
Infinite hierarchical potential games
Infinite hierarchical potential games
2000,
Hierarchical potential games with infinite strategy sets are considered. For these...
On existence of Nash equilibria of games with constraints on multistrategies
On existence of Nash equilibria of games with constraints on multistrategies
2000,
In this paper, sufficient conditions are given, which are less restrictive than those...
On applied nonlinear and bilevel programming for pursuit–evasion games
On applied nonlinear and bilevel programming for pursuit–evasion games
2001,
Motivated by the benefits of discretization in optimal control problems, we consider...
Solvable states in n-player stochastic games
Solvable states in n-player stochastic games
2000,
We prove that, in every stochastic game with finitely many states and actions, there...
Zero sum absorbing games with incomplete information on one side: Asymptotic analysis
Zero sum absorbing games with incomplete information on one side: Asymptotic analysis
2000,
We prove the existence of the limit of the values of finitely repeated (or discounted)...
An algorithm for enumerating all spanning trees of a directed graph
An algorithm for enumerating all spanning trees of a directed graph
2000,
We present an O(NV + V³) time algorithm for enumerating all spanning trees...
The wide-diameter of the n-dimensional toroidal mesh
The wide-diameter of the n-dimensional toroidal mesh
1996,
In graph theory and a study of transmission delay and fault tolerance of networks, the...
2-diameter of de Bruijn graphs
2-diameter of de Bruijn graphs
1996,
This paper shows that in the undirected binary de Bruijn graph of dimension n, UB(n) ,...
Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs
Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs
1996,
We present a simple optimal algorithm for the problem of finding maximum independent...
Divide-and-conquer algorithms for graph-layout problems
Divide-and-conquer algorithms for graph-layout problems
1996,
Tutte introduced a decomposition of 2-connected graphs which has widely been used in...
On the connectivity and the conditional diameter of graphs and digraphs
On the connectivity and the conditional diameter of graphs and digraphs
1996,
Recently, it was proved that if the diameter D of a graph G is small enough in...
On eccentric vertices in graphs
On eccentric vertices in graphs
1996,
The eccentricity e(v) of a vertex v in a connected graph G is the distance between v...
Magic labeling in graphs: Bounds, complexity, and an application to a variant of travelling salesman problem
Magic labeling in graphs: Bounds, complexity, and an application to a variant of travelling salesman problem
1996,
Let G be an undirected graph with n vertices and m edges. A natural number λ is...
The bottleneck graph partition problem
The bottleneck graph partition problem
1996,
The bottleneck graph partition problem is to partition the nodes of a graph into two...
Efficient path and vertex exchange in Steiner tree algorithms
Efficient path and vertex exchange in Steiner tree algorithms
1997,
Steiner's problem in a weighted graph requires a tree of minimum total weight spanning...
Algorithms for computing message delay for wireless networks
Algorithms for computing message delay for wireless networks
1997,
In this paper, we consider the problem of computing the expected message delay in a...
The superposition of discrete-time Markov renewal processes with an application to statistical multiplexing of bursty traffic sources
The superposition of discrete-time Markov renewal processes with an application to statistical multiplexing of bursty traffic sources
2000,
The main contribution in this paper is the introduction of a methodology for...
Bounded-parameter Markov decision processes
Bounded-parameter Markov decision processes
2000,
In this paper, we introduce the notion of a bounded-parameter Markov decision process...
Near-optimal bounded-degree spanning trees
Near-optimal bounded-degree spanning trees
2001,
Random costs C ( i,j ) are assigned to the area of a complete directed graph on n...
Papers per page: