We show that language inclusion for languages of infinite words defined by nondeterministic automata can be tested in polynomial time if the automata are unambiguous and have simple acceptance conditions, namely safety or reachability conditions. An automaton with safety condition accepts an infinite word if there is a run that never visits a forbidden state, and an automaton with reachability ...

We experimentally examine equilibrium refinements in static and dynamic binary choice games of complete information with strategic complementarities known as “entry” games. Examples include speculative attacks, bank runs and refinancing decisions by multiple lenders. We explore behavior when the value of a payoff relevant state variable is known to all players in advance of making their action ...

Abstract This longitudinal study explores persistence in research productivity at the individual level over academic lifetime: can highly productive scientists maintain relatively high levels of productivity. We examined careers 2326 Polish full professors, including their lifetime biographical and publication histories. studied promotions publications between (79,027 articles) a 40-year period...

This paper focuses on the design of unreliable failure detectors of the Eventually Perfect class (3P) in crash-prone partially synchronous systems. We adopt a monitoring mechanism based on heartbeats over a logical ring arrangement of processes as the common design feature. This provides good communication efficiency, a performance parameter which refers to the number of links that carry messag...

What is the strongest Brønsted acid, base, oxidizing agent? If not understood in an absolute, once-and-forever sense, answers to such questions may help at extending and reinforcing meaning of simple concepts first-year chemistry courses. Moreover, they serve purpose introducing research aspects linking them general chemistry.

An automaton is universal if it accepts every possible input. We study the notion of u-universality, which asserts that the automaton accepts every input starting with u. Universality and u-universality are both EXPTIME-hard for non-deterministic tree automata. We propose efficient antichain-based techniques to address these problems for visibly pushdown automata operating on trees. One of our ...

We analyze the behavior of a monopolistic firm in general equilibrium when the firm’s decision are taken through shareholder voting. We show that, depending on the underlying distribution, rational voting may imply overproduction as well as underproduction, relative to the efficient level. Any initial distribution of shares is an equilibrium, if individuals do not recognize their influence on v...