Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Berkeley, Calif. : Berkeley Electronic Press (now: De Gruyter)
    Contributions to theoretical economics 4.2004, 1, art5 
    ISSN: 1534-5971
    Source: Berkeley Electronic Press Academic Journals
    Topics: Economics
    Notes: We provide elementary and uniform proofs of order independence for various strategy elimination procedures for finite strategic games, both for dominance by pure and by mixed strategies. The proofs follow the same pattern and focus on the structural properties of the dominance relations. They rely on Newman's Lemma established in 1942 and related results on the abstract reduction systems.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Berkeley, Calif. : Berkeley Electronic Press (now: De Gruyter)
    The @B.E. journal of theoretical economics 7.2007, 1, art18 
    ISSN: 1555-0478
    Source: Berkeley Electronic Press Academic Journals
    Topics: Economics
    Notes: The rationalizability concept was introduced in Bernheim [Ber84] and Pearce [Pea84] to assess what can be inferred by rational players in a non-cooperative game in the presence of common knowledge. However, this notion can be defined in a number of ways that differ in seemingly unimportant minor details. We shed light on these differences, explain their impact, and clarify for which games these definitions coincide.Then we apply the same analysis to explain the differences and similarities between various ways the iterated elimination of strictly dominated strategies was defined in the literature. This allows us to clarify the results of Dufwenberg and Stegeman [DS02] and Chen, Long and Luo [CLL05] and improve upon them. We also consider the extension of these results to strict dominance by a mixed strategy.Our approach is based on a general study of the operators on complete lattices. We allow transfinite iterations of the considered operators and clarify the need for them. The advantage of such a general approach is that a number of results, including order independence for some of the notions of rationalizability and strict dominance, come for free.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Distributed computing 2 (1988), S. 226-241 
    ISSN: 1432-0452
    Keywords: Fairness ; Distributed computing ; Communication ; Partial order semantics ; Semantic criteria
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The relations among various languages and models for distributed computation and various possible definitions of fairness are considered. Natural semantic criteria are presented which an acceptable notion of fairness should satisfy. These are then used to demonstrate differences among the basic models, the added power of the fairness notion, and the sensitivity of the fairness notion to irrelevant semantic interleavings of independent operations. These results are used to show that from the considerable variety of commonly used possibilities, only strong process fairness is appropriate forCSP if these criteria are adopted. We also show that under these criteria, none of the commonly used notions of fairness are fully aceptable for a model with an n-way synchronization mechanism. The notion of fairness most often mentioned for Ada is shown to be fully acceptable. For a model with nonblockingsend operations, some variants of common fairness definitions are appraised, and two are shown to satisfy the suggested criteria.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Applicable algebra in engineering, communication and computing 5 (1994), S. 159-191 
    ISSN: 1432-0622
    Keywords: Prolog programs ; Builtin's ; Declarative semantics ; Termination ; 68Q40 ; 68T15 ; F.3.2 ; F.4.1 ; H.3.3 ; I.2.3
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics , Technology
    Notes: Abstract We provide here a framework for studying Prolog programs with various built-in's that include arithmetic operations, and such metalogical relations likevar andground. To this end we propose a new, declarative semantics and prove completeness of the Prolog computation mechanism w.r.t. this semantics. We also show that this semantics is fully abstract in an appropriate sense. Finally, we provide a method for proving termination of Prolog programs with built-in's which uses this semantics. The method is shown to be modular and is illustrated by proving termination of a number of programs including the unify program of Sterling and Shapiro [17].
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Acta informatica 15 (1981), S. 219-232 
    ISSN: 1432-0525
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary We prove that recursive assertions are enough for proofs of parallel programs considered in Owicki and Gries [7]. In other words, we prove that for any parallel program S and recursive assertions p and q if {p} S{q} is true under the standard interpretation in natural numbers then all intermediate assertions needed in the proof can be chosen recursive. Finally, we show that if auxiliary variables are used only as program counters then the above result does not hold.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Formal aspects of computing 6 (1994), S. 743-765 
    ISSN: 1433-299X
    Keywords: Prolog programs ; Program verification
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We provide here a systematic comparative study of the relative strength and expressive power of a number of methods for program analysis of Prolog. Among others we show that these methods can be arranged in the following hierarchy: mode analysis ⇒ type analysis ⇒ monotonic properties ⇒ nonmonotonic run-time properties. We also discuss a method allowing us to prove global run-time properties.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Book
    Book
    Cambridge [u.a.] :Cambridge Univ. Press,
    Title: Principles of constraint programming /
    Author: Apt, Krzysztof R.
    Publisher: Cambridge [u.a.] :Cambridge Univ. Press,
    Year of publication: 2003
    Pages: XII, 407 S.
    ISBN: 0-521-82583-0
    Type of Medium: Book
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...