| 1. |
- Eriksson, Kimmo, 1967-, et al.
(författare)
-
Biases for acquiring information individually rather than socially
- 2009
-
Ingår i: Journal of Evolutionary Psychology. - 0737-4828. ; 7:4, s. 309-329
-
Tidskriftsartikel (refereegranskat)abstract
- We discuss theoretical and empirical arguments for a human bias to acquire information individually rather than socially. In particular, we argue that when other people can be observed, information collection is a public good and hence some of the individual variation in the choice between individual and social learning can be explained by variation in social value orientation. We conducted two experimental studies, based on the game Explore & Collect, to test the predictions that (1) socially and individually acquired information of equal objective value are treated differently, and (2) prosocial subjects tend to spend more effort than selfish subjects on individual acquiring of information. Both predictions were supported.
|
|
| 2. |
|
|
| 3. |
- Eriksson, Henrik, et al.
(författare)
-
Conjugacy of Coxeter elements
- 2009
-
Ingår i: The Electronic Journal of Combinatorics. - 1097-1440 .- 1077-8926. ; 16:2
-
Tidskriftsartikel (refereegranskat)abstract
- For a Coxeter group (W, S), a permutation of the set S is called a Coxeter word and the group element represented by the product is called a Coxeter element. Moving the first letter to the end of the word is called a rotation and two Coxeter elements are rotation equivalent if their words can be transformed into each other through a sequence of rotations and legal commutations. We prove that Coxeter elements are conjugate if and only if they are rotation equivalent. This was known for some special cases but not for Coxeter groups in general.
|
|
| 4. |
- Eriksson, Kimmo, 1967-, et al.
(författare)
-
Partner Search Heuristics in the Lab: : Stability of Matchings Under Various Preference Structures
- 2009
-
Ingår i: Adaptive Behavior. - : SAGE Publications. - 1059-7123 .- 1741-2633. ; 17:6, s. 524-536
-
Tidskriftsartikel (refereegranskat)abstract
- When agents search for partners, the outcome is a matching. K. Eriksson and O. Häggström (2008) defined a measure of instability of matchings and proved that under a certain partner search heuristic, outcomes are likely to have low instability. They also showed that with regards to stability, the preference structure known as common preferences lie somewhere in between the extreme cases of homotypic and antithetical preferences. Following up on this theoretical work, we let human subjects search for a good partner in a computer game where preferences were set to be either common, homotypic, or antithetical. We find that total search effort and instability of the outcome vary in the predicted ways with the preference structure and the number of agents. A set of simulations show that these results are consistent with a model where agents use a simple search heuristic with a slight possibility of error.
|
|
| 5. |
- Rullgård, Hans
(författare)
-
An explicit inversion formula for the exponential Radon transform using data from 180 degrees
- 2004
-
Ingår i: Arkiv för Matematik. - 0004-2080 .- 1871-2487. ; 42:2, s. 353-362
-
Tidskriftsartikel (refereegranskat)abstract
- We derive a direct inversion formula for the exponential Radon transform. Our formula requires only the values of the transform over an 180° range of angles. It is an explicit formula, except that it involves a holomorphic function for which an explicit expression has not been found. In practice, this function can be approximated by an easily computed polynomial of rather low degree.
|
|
| 6. |
- Loukanova, Roussanka
(författare)
-
Relationships between Specified and Underspecified Quantification by the Theory of Acyclic Recursion
- 2016
-
Ingår i: ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal. - 2255-2863. ; 5:4, s. 19-42
-
Tidskriftsartikel (refereegranskat)abstract
- The paper introduces a technique for representing quantifier relations that can have different scope order depending on context. The technique is demonstrated by classes of terms denoting relations, where each of the arguments of a relation term is bound by a different quantifier. We represent a formalization of linking quantifiers with the corresponding argument slots that they bind, across lambda-abstractions and reduction steps. The purpose of the technique is to represent underspecified order of quantification, in the absence of a context and corresponding information about the order. Furthermore, it is used to represent subclasses of larger classes of relations depending on order of quantification or specific relations.
|
|
| 7. |
- Loukanova, Roussanka
(författare)
-
Underspecified Relations with a Formal Language of Situation Theory
- 2015
-
Ingår i: Proceedings of the 7th International Conference on Agents and Artificial Intelligence. - : SciTePress. - 9789897580734 ; , s. 298-309
-
Konferensbidrag (refereegranskat)abstract
- The paper is an introduction to a formal language of Situation Theory. The language provides algorithmic processing of situated information. We introduce specialized, restricted variables that are recursively constrained to satisfy type-theoretic conditions by restrictions and algorithmic assignments. The restricted variables designate recursively connected networks of memory locations for `saving' parametric information that depends on situations and restrictions over objects. The formal definitions introduce richly informative typed language for classification and representation of underspecified, parametric, and partial information that is dependent on situations.
|
|
| 8. |
-
Proceedings of the Symposium on Logic and Algorithms in Computational Linguistics 2018 (LACompLing2018)
- 2018
-
Proceedings (redaktörskap) (refereegranskat)abstract
- Computational linguistics studies natural language in its various manifestations from a computational point of view, both on the theoretical level (modeling grammar modules dealing with natural language form and meaning, and the relation between these two) and on the practical level (developing applications for language and speech technology). Right from the start in the 1950ties, there have been strong links with computer science, logic, and many areas of mathematics - one can think of Chomsky's contributions to the theory of formal languages and automata, or Lambek's logical modeling of natural language syntax. The symposium on Logic and Algorithms in Computational Linguistics 2018 (LACompLing2018) assesses the place of logic, mathematics, and computer science in present day computational linguistics. It intends to be a forum for presenting new results as well as work in progress.
|
|
| 9. |
-
Proceedings of the Workshop on Logic and Algorithms in Computational Linguistics 2017 (LACompLing2017)
- 2017
-
Proceedings (redaktörskap) (refereegranskat)abstract
- Computational linguistics studies natural language in its various manifestations from a computational point of view, both on the theoretical level (modeling grammar modules dealing with natural language form and meaning, and the relation between these two) and on the practical level (developing applications for language and speech technology). Right from the start in the 1950ties, there have been strong links with computer science, logic, and many areas of mathematics - one can think of Chomsky's contributions to the theory of formal languages and automata, or Lambek's logical modeling of natural language syntax. The workshop assesses the place of logic, mathematics, and computer science in present day computational linguistics. It intends to be a forum for presenting new results as well as work in progress.
|
|
| 10. |
|
|
