Skip to search formSkip to main contentSkip to account menu
A Very Hard log-Space Counting Class
View via Publisher
A Characterization of Universal Stability in the Adversarial Queuing Model
TLDR
It is shown that variations of the allowed packet trajectory lead to nonequivalent characterizations, which are able to provide polynomial time algorithms for testing stability under the \NTGLIS (Nearest To Go-Longest In System) protocol.
View via Publisher
Pure Nash Equilibria in Games with a Large Number of Actions
TLDR
It is shown that deciding the existence of a Nash equilibrium in a strategic game is NP-complete when the number of players is large and the number and size of strategies for each player is constant, while the problem is Σ$^{p}_{\rm 2}$- complete when the Number of Players is a constant and the size of the sets of strategies is exponential.
View via Publisher
A compendium of problems complete for symmetric logarithmic space
Abstract. The paper's main contributions are a compendium of problems that are complete for symmetric logarithmic space (SL), a collection of material relating to SL, a list of open problems, and an…
View on Springer
Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees,
TLDR
This paper proposes three ways of representing a game with different degrees of succinctness for the components of the game and shows that when the number of moves of each player is large and the player function and the utilities are represented succinctly the considered problems are PSPACE-complete.
View via Publisher
A very hard log space counting class
TLDR
It is demonstrated that span-L-functions can be computed in polynomial time if and only if P=NP=PH=P( Hash P), i.e if the class P(Hash P) and all the classes of thePolynomial-time hierarchy are contained in P.
View on IEEE
Network Creation Games: Structure vs Anarchy
TLDR
In this paper, new insights are given into the structure of the Nash equilibria for different ranges of $\alpha$ and the range for which the price of anarchy is constant is enlarged.
View PDF on arXiv
Universal stability of undirected graphs in the adversarial queueing model
TLDR
It is shown that universal stability of digraphs, in the case in which packets follow directed paths without repeating vertices, can be decided in polynomial time, and is equivalent to \NTGLIS-stability, in all the cases.
View on ACM
Adaptive logspace reducibility and parallel time
TLDR
By imposing appropriate bounds on the number of functional oracle queries made in this computation model, this work obtains new characterizations of the NC and AC hierarchies and solves open questions of Wilson.
View on Springer
Adversarial models for priority‐based networks
TLDR
This article proposes several variations of the adversarial queueing model, and provides a characterization of the networks that are stable under first‐in‐first‐out (FIFO) and LIS in the failure model (and therefore in the reliable and priority models), and shows that the stability problem under FIFO and L IS in theFailure model can be solved in polynomial time.
View on Wiley
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License