Results 1  10
of
3,201,708
Quantal Response Equilibria For Normal Form Games
 NORMAL FORM GAMES, GAMES AND ECONOMIC BEHAVIOR
, 1995
"... We investigate the use of standard statistical models for quantal choice in a game theoretic setting. Players choose strategies based on relative expected utility, and assume other players do so as well. We define a Quantal Response Equilibrium (QRE) as a fixed point of this process, and establish e ..."
Abstract

Cited by 634 (27 self)
 Add to MetaCart
We investigate the use of standard statistical models for quantal choice in a game theoretic setting. Players choose strategies based on relative expected utility, and assume other players do so as well. We define a Quantal Response Equilibrium (QRE) as a fixed point of this process, and establish existence. For a logit specification of the error structure, we show that as the error goes to zero, QRE approaches a subset of Nash equilibria and also implies a unique selection from the set of Nash equilibria in generic games. We fit the model to a variety of experimental data sets by using maximum likelihood estimatation.
Normal forms for . . .
, 2008
"... We derive a normal form for a nearintegrable, fourdimensional symplectic map with a fold or cusp singularity in its frequency mapping. The normal form is obtained for when the frequency is near a resonance and the mapping is approximately given by the timeT mapping of a twodegreeof freedom Hami ..."
Abstract
 Add to MetaCart
We derive a normal form for a nearintegrable, fourdimensional symplectic map with a fold or cusp singularity in its frequency mapping. The normal form is obtained for when the frequency is near a resonance and the mapping is approximately given by the timeT mapping of a twodegreeof freedom
Decomposable negation normal form
 Journal of the ACM
, 2001
"... Abstract. Knowledge compilation has been emerging recently as a new direction of research for dealing with the computational intractability of general propositional reasoning. According to this approach, the reasoning process is split into two phases: an offline compilation phase and an online quer ..."
Abstract

Cited by 133 (19 self)
 Add to MetaCart
(OBDDs). We propose in this paper a new target compilation language, known as decomposable negation normal form (DNNF), and present a number of its properties that make it of interest to the broad community. Specifically, we
A Normal Form for XML Documents
"... This paper takes a rst step towards the design and normalization theory for XML documents. We show that, like relational databases, XML documents may contain redundant information, and may be prone to update anomalies. Furthermore, such problems are caused by certain functional dependencies among p ..."
Abstract

Cited by 168 (9 self)
 Add to MetaCart
paths in the document. Our goal is to nd a way of converting an arbitrary DTD into a welldesigned one, that avoids these problems. We rst introduce the concept of a functional dependency for XML, and de ne its semantics via a relational representation of XML. We then de ne an XML normal form, XNF
Experienceweighted Attraction Learning in Normal Form Games
 ECONOMETRICA
, 1999
"... We describe a general model, `experienceweighted attraction' (EWA) learning, which includes reinforcement learning and a class of weighted fictitious play belief models as special cases. In EWA, strategies have attractions which reflect prior predispositions, are updated based on payoff experi ..."
Abstract

Cited by 271 (25 self)
 Add to MetaCart
We describe a general model, `experienceweighted attraction' (EWA) learning, which includes reinforcement learning and a class of weighted fictitious play belief models as special cases. In EWA, strategies have attractions which reflect prior predispositions, are updated based on payoff experience, and determine choice probabilities according to some rule (e.g., logit). A key feature is a parameter delta which weights the strength of hypothetical reinforcement of strategies which were not chosen according to the payoff they would have yielded. When delta = 0 choice reinforcement results. When delta = 1, levels of reinforcement of strategies are proportional to expected payoffs given beliefs based on past history. Another key feature is the growth rates of attractions. The EWA model controls the growth rates by two decay parameters, phi and rho, which depreciate attractions and amount of experience separately. When phi = rho, beliefbased models result; when rho = 0 choice reinforcement results. Using three data se...
On Generating Small Clause Normal Forms
, 1998
"... In this paper we focus on two powerful techniques to obtain compact clause normal forms: Renaming of formulae and refined Skolemization methods. We illustrate their effect on various examples. By an exhaustive experiment of all firstorder TPTP problems, it shows that our clause normal form tran ..."
Abstract

Cited by 108 (3 self)
 Add to MetaCart
In this paper we focus on two powerful techniques to obtain compact clause normal forms: Renaming of formulae and refined Skolemization methods. We illustrate their effect on various examples. By an exhaustive experiment of all firstorder TPTP problems, it shows that our clause normal form
Normal forms of random braids
, 2013
"... Analysing statistical properties of the normal forms of random braids, we observe that, except for an initial and a final region whose lengths are uniformly bounded (that is, the bound is independent of the length of the braid), the distributions of the factors of the normal form of sufficiently lon ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Analysing statistical properties of the normal forms of random braids, we observe that, except for an initial and a final region whose lengths are uniformly bounded (that is, the bound is independent of the length of the braid), the distributions of the factors of the normal form of sufficiently
Eager normal form bisimulation
 In Proc. 20th Annual IEEE Symposium on Logic in Computer Science
, 2005
"... Abstract. Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize LévyLongo tree equivalence and Boehm tree equivalence. It has been adapted to a range of untyped, higherorder calculi, but types have presented a difficulty. In this paper, we prese ..."
Abstract

Cited by 20 (8 self)
 Add to MetaCart
Abstract. Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize LévyLongo tree equivalence and Boehm tree equivalence. It has been adapted to a range of untyped, higherorder calculi, but types have presented a difficulty. In this paper, we
Normal forms for knowledge compilation
 Proceedings of the International Symposium on Methodologies for Intelligent Systems, (ISMIS ‘05, Z. Ras ed.), Lecture Notes in Computer Science
, 2005
"... Abstract. A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLLlike tableau procedure for computing them that operates in PSPACE.Ordered factored negation normal form provides a canonical representation for any boolean function ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
Abstract. A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLLlike tableau procedure for computing them that operates in PSPACE.Ordered factored negation normal form provides a canonical representation for any boolean
Results 1  10
of
3,201,708