Results 1  10
of
28,995
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 647 (28 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
"... 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 queryanswer ..."
Abstract

Cited by 128 (17 self)
 Add to MetaCart
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
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 279 (27 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...
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 167 (8 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
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 for HopfZero . . .
"... In this paper we are concerned with the simplest normal form computation of the systems ..."
Abstract
 Add to MetaCart
In this paper we are concerned with the simplest normal form computation of the systems
SMITH NORMAL FORM IN COMBINATORICS
, 2015
"... This paper surveys some combinatorial aspects of Smith normal form, and more generally, diagonal form. The discussion includes general algebraic properties and interpretations of Smith normal form, critical groups of graphs, and Smith normal form of random integer matrices. We then give some examp ..."
Abstract
 Add to MetaCart
This paper surveys some combinatorial aspects of Smith normal form, and more generally, diagonal form. The discussion includes general algebraic properties and interpretations of Smith normal form, critical groups of graphs, and Smith normal form of random integer matrices. We then give some
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
Results 1  10
of
28,995