Results 1  10
of
4,176
Inequality Aversion, Efficiency, and Maximin Preferences in Simple Distribution Experiments
, 2002
"... We present simple oneshot distribution experiments comparing the relative importance of efficiency, maximin preferences and inequality aversion, as well as the relative performance of the fairness theories by Bolton and Ockenfels (2000) and Fehr and Schmidt (1999). While the Fehr and Schmidt model ..."
Abstract

Cited by 165 (2 self)
 Add to MetaCart
We present simple oneshot distribution experiments comparing the relative importance of efficiency, maximin preferences and inequality aversion, as well as the relative performance of the fairness theories by Bolton and Ockenfels (2000) and Fehr and Schmidt (1999). While the Fehr and Schmidt model
DI–economies: Contracts, Incentive Compatibility and Learning under Maximin Preferences
, 2013
"... This is a purely theoretical project aimed to study economic models with asymmetrically distributed information. The construction and study of the models of this type is a problem of great theoretical significance and develops microeconomic theory and the theory of general economic equilibrium. ..."
Abstract
 Add to MetaCart
This is a purely theoretical project aimed to study economic models with asymmetrically distributed information. The construction and study of the models of this type is a problem of great theoretical significance and develops microeconomic theory and the theory of general economic equilibrium.
2006), "Inequality Aversion, Efficiency, and Maximin Preferences in Simple Distribution Experiments: Comment
 American Economic Review
"... A major puzzle in the literature on social preferences is that a large majority of subjects behaves as if completely selfinterested in some circumstances, such as in competitive experimental markets with standardized goods or in the final rounds of public goods experiments; while in other circumsta ..."
Abstract

Cited by 29 (5 self)
 Add to MetaCart
A major puzzle in the literature on social preferences is that a large majority of subjects behaves as if completely selfinterested in some circumstances, such as in competitive experimental markets with standardized goods or in the final rounds of public goods experiments; while in other
BDI Agents: From Theory to Practice
 IN PROCEEDINGS OF THE FIRST INTERNATIONAL CONFERENCE ON MULTIAGENT SYSTEMS (ICMAS95
, 1995
"... The study of computational agents capable of rational behaviour has received a great deal of attention in recent years. Theoretical formalizations of such agents and their implementations have proceeded in parallel with little or no connection between them. This paper explores a particular typ ..."
Abstract

Cited by 880 (3 self)
 Add to MetaCart
The study of computational agents capable of rational behaviour has received a great deal of attention in recent years. Theoretical formalizations of such agents and their implementations have proceeded in parallel with little or no connection between them. This paper explores a particular type of rational agent, a BeliefDesire Intention (BDI) agent. The primary aim of this paper is to integrate (a) the theoretical foundations of BDI agents from both a quantitative decisiontheoretic perspective and a symbolic reasoning perspective; (b) the implementations of BDI agents from an ideal theoretical perspective and a more practical perspective; and (c) the building of largescale applications based on BDI agents. In particular, an airtraffic management application will be described from both a theoretical and an implementation perspective.
Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules
, 2002
"... In a recent Physical Review Letters paper, Vicsek et. al. propose a simple but compelling discretetime model of n autonomous agents fi.e., points or particlesg all moving in the plane with the same speed but with dierent headings. Each agent's heading is updated using a local rule based on ..."
Abstract

Cited by 1245 (60 self)
 Add to MetaCart
In a recent Physical Review Letters paper, Vicsek et. al. propose a simple but compelling discretetime model of n autonomous agents fi.e., points or particlesg all moving in the plane with the same speed but with dierent headings. Each agent's heading is updated using a local rule based on the average of its own heading plus the headings of its \neighbors." In their paper, Vicsek et. al. provide simulation results which demonstrate that the nearest neighbor rule they are studying can cause all agents to eventually move in the same direction despite the absence of centralized coordination and despite the fact that each agent's set of nearest neighbors change with time as the system evolves. This paper provides a theoretical explanation for this observed behavior. In addition, convergence results are derived for several other similarly inspired models.
Bargaining with intertemporal maximin payoffs
, 2011
"... Bargaining with intertemporal maximin payoffs ..."
Quantization for Maximin ARE in Distributed Estimation
"... Abstract—We consider the design of optimal quantizers for the distributed estimation of a deterministic parameter. In particular, we design deterministic scalar quantizers to maximize the minimum asymptotic relative efficiency (ARE) between quantized and unquantized ML estimators. We first design id ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Abstract—We consider the design of optimal quantizers for the distributed estimation of a deterministic parameter. In particular, we design deterministic scalar quantizers to maximize the minimum asymptotic relative efficiency (ARE) between quantized and unquantized ML estimators. We first design identical quantizers using the class of scorefunction quantizers (SFQ). We show that the structure of SFQs generally depend on the parameter value, but can be expressed as thresholds on the sufficient statistic for a large class of distributions. We provide a convergent iterative algorithm to obtain the best SFQ that maximizes the minimum ARE for distributions of that class. We compare the performance of the optimal SFQ with a general quantizer designed without making any restrictions on the structure. This general quantizer is hard to implement due to lack of structure, but is optimal if the iterative design algorithm does not encounter local minima. Through numerical simulations, we illustrate that the two quantizers designed are identical. In other words, the optimal quantizer structure is that of an SFQ. For a distributed estimation setup, designing identical quantizers is shown to be suboptimal. We, therefore, propose a joint multiple quantizer design algorithm based on a personbyperson optimization technique employing the SFQ structure. Using numerical examples, we illustrate the gain in performance due to designing nonidentical quantizers. Index Terms—Asymptotic relative efficiency (ARE), distributed estimation, quantization, scorefunction quantizer (SFQ).
Aggregate Preferred Correspondence and the Existence of a Maximin REE
"... In this paper, a general model of a pure exchange differential information economy is studied. In this economic model, the space of states of nature is a complete probability measure space, the space of agents is a measure space with a finite measure, and the commodity space is the Euclidean space ..."
Abstract
 Add to MetaCart
space. Under appropriate and standard assumptions on agents ’ characteristics, results on continuity and measurability of the aggregate preferred correspondence in the sense of Aumann [8] are established. These results together with other techniques are then employed to prove the existence of a
Maximin Play in TwoPerson
"... VITALY PRUZHANSKY Abstract. Since the seminal paper of Nash [7] game theoretic literature has focused mostly on equilibrium and not on maximin (minimax) strategies. We study the properties of these strategies in 2player nonzerosum strategic games, whose Nash equilibria are only mixed. 1. ..."
Abstract
 Add to MetaCart
VITALY PRUZHANSKY Abstract. Since the seminal paper of Nash [7] game theoretic literature has focused mostly on equilibrium and not on maximin (minimax) strategies. We study the properties of these strategies in 2player nonzerosum strategic games, whose Nash equilibria are only mixed. 1.
MAXIMIN, DISCOUNTING, AND SEPARATING HYPERPLANES
"... Is Hartwick’s rule a necessary condition for maximin in Solow’s [1974] model? Until recently this has been an open question; this is surprising given the prominence of the model. Cairns and Yang [2000] as well as Withagen, Asheim and Buchholz (this issue) claim that the answer is in the affirmative ..."
Abstract
 Add to MetaCart
Is Hartwick’s rule a necessary condition for maximin in Solow’s [1974] model? Until recently this has been an open question; this is surprising given the prominence of the model. Cairns and Yang [2000] as well as Withagen, Asheim and Buchholz (this issue) claim that the answer is in the affirmative
Results 1  10
of
4,176