940 resultados para Epistemic objects


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Relatório de estágio de mestrado em Património e Turismo Cultural

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Dissertação de mestrado em Comunicação, Arte e Cultura

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Dissertação de mestrado em História

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Dissertação de mestrado em Ciências da Comunicação (área de especialização em Publicidade e Relações Públicas)

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Dissertação de mestrado em Ciências da Comunicação (área de especialização em Audiovisual e Multimédia)

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Dissertação de mestrado em Ciências da Linguagem

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Dissertação de Mestrado em Comunicação Social

Relevância:

10.00% 10.00%

Publicador:

Resumo:

I consider the problem of assigning agents to objects where each agent must pay the price of the object he gets and prices must sum to a given number. The objective is to select an assignment-price pair that is envy-free with respect to the true preferences. I prove that the proposed mechanism will implement both in Nash and strong Nash the set of envy-free allocations. The distinguishing feature of the mechanism is that it treats the announced preferences as the true ones and selects an envy-free allocation with respect to the announced preferences.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

I analyze an economy with uncertainty in which a set of indivisible objects and a certain amount of money is to be distributed among agents. The set of intertemporally fair social choice functions based on envy-freeness and Pareto efficiency is characterized. I give a necessary and sufficient condition for its non-emptiness and propose a mechanism that implements the set of intertemporally fair allocations in Bayes-Nash equilibrium. Implementation at the ex ante stage is considered, too. I also generalize the existence result obtained with envy-freeness using a broader fairness concept, introducing the aspiration function.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We study a simple model of assigning indivisible objects (e.g., houses, jobs, offices, etc.) to agents. Each agent receives at most one object and monetary compensations are not possible. We completely describe all rules satisfying efficiency and resource-monotonicity. The characterized rules assign the objects in a sequence of steps such that at each step there is either a dictator or two agents "trade" objects from their hierarchically specified "endowments."

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We study the assignment of indivisible objects with quotas (houses, jobs, or offices) to a set of agents (students, job applicants, or professors). Each agent receives at most one object and monetary compensations are not possible. We characterize efficient priority rules by efficiency, strategy-proofness, and renegotiation-proofness. Such a rule respects an acyclical priority structure and the allocations can be determined using the deferred acceptance algorithm.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We consider social choice problems where a society must choose a subset from a set of objects. Specifically, we characterize the families of strategy-proof voting procedures when not all possible subsets of objects are feasible, and voters' preferences are separable or additively representable.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We prove that, under suitable assumptions on a category C, the existence of supercompact cardinals implies that every absolute epireflective class of objects of C is a small-orthogonality class. More precisely, if L is a localization functor on an accessible category C such that the unit morphism X→LX is an extremal epimorphism for all X, and the class of L-local objects is defined by an absolute formula with parameters, then the existence of a supercompact cardinal above the cardinalities of the parameters implies that L is a localization with respect to some set of morphisms.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The Stanley lattice, Tamari lattice and Kreweras lattice are three remarkable orders defined on the set of Catalan objects of a given size. These lattices are ordered by inclusion: the Stanley lattice is an extension of the Tamari lattice which is an extension of the Kreweras lattice. The Stanley order can be defined on the set of Dyck paths of size n as the relation of being above. Hence, intervals in the Stanley lattice are pairs of non-crossing Dyck paths. In a former article, the second author defined a bijection Φ between pairs of non-crossing Dyck paths and the realizers of triangulations (or Schnyder woods). We give a simpler description of the bijection Φ. Then, we study the restriction of Φ to Tamari’s and Kreweras’ intervals. We prove that Φ induces a bijection between Tamari intervals and minimal realizers. This gives a bijection between Tamari intervals and triangulations. We also prove that Φ induces a bijection between Kreweras intervals and the (unique) realizers of stack triangulations. Thus, Φ induces a bijection between Kreweras intervals and stacktriangulations which are known to be in bijection with ternary trees.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Recently there has been a great deal of work on noncommutative algebraic cryptography. This involves the use of noncommutative algebraic objects as the platforms for encryption systems. Most of this work, such as the Anshel-Anshel-Goldfeld scheme, the Ko-Lee scheme and the Baumslag-Fine-Xu Modular group scheme use nonabelian groups as the basic algebraic object. Some of these encryption methods have been successful and some have been broken. It has been suggested that at this point further pure group theoretic research, with an eye towards cryptographic applications, is necessary.In the present study we attempt to extend the class of noncommutative algebraic objects to be used in cryptography. In particular we explore several different methods to use a formal power series ring R && x1; :::; xn && in noncommuting variables x1; :::; xn as a base to develop cryptosystems. Although R can be any ring we have in mind formal power series rings over the rationals Q. We use in particular a result of Magnus that a finitely generated free group F has a faithful representation in a quotient of the formal power series ring in noncommuting variables.