4 The First Utility Model – The Central Station Grid

2021 ◽  
pp. 46-58
2021 ◽  
pp. 104346312199596
Author(s):  
François Facchini ◽  
Louis Jaeck

This article proposes a general model of partisan political dealignment based on the theory of expressive voting. It is based on the Riker and Odershook equation. Voters cast a ballot for a political party if the utility associated with expressing their support for it is more than their expressive costs. Expressive utility is modeled here as a certain utility model. Then, the model is applied to the rise of voting support in favor of French right-wing populists, the National Front (FN). We show that the fall of justification costs of FN ideology along with the decline in stigmatization costs of voting in favor of the extreme right has fostered the popularity of this party. Political dealignment here is only a particular case of a general process of political norms transgression inherited by each voter.


2019 ◽  
Vol 19 (1) ◽  
Author(s):  
Zhen Wang ◽  
Tomislav Vukina

Abstract In this paper, we investigate sorting patterns among chicken producers who are offered a menu of contracts to choose from. We show that the sorting equilibrium reveals a positive sorting where higher ability producers self-select themselves into contracts to grow larger chickens and lower ability types self-select themselves into contracts to grow smaller birds. We also show that eliciting this type of sorting behavior is profit maximizing for the principal. In the empirical part of the paper, we first estimate growers’ abilities using a two-way fixed effects model and subsequently use these estimated abilities to estimate a random utility model of contract choice. Our empirical results are supportive of the developed theory.


2021 ◽  
Vol 36 ◽  
Author(s):  
Sergio Valcarcel Macua ◽  
Ian Davies ◽  
Aleksi Tukiainen ◽  
Enrique Munoz de Cote

Abstract We propose a fully distributed actor-critic architecture, named diffusion-distributed-actor-critic Diff-DAC, with application to multitask reinforcement learning (MRL). During the learning process, agents communicate their value and policy parameters to their neighbours, diffusing the information across a network of agents with no need for a central station. Each agent can only access data from its local task, but aims to learn a common policy that performs well for the whole set of tasks. The architecture is scalable, since the computational and communication cost per agent depends on the number of neighbours rather than the overall number of agents. We derive Diff-DAC from duality theory and provide novel insights into the actor-critic framework, showing that it is actually an instance of the dual-ascent method. We prove almost sure convergence of Diff-DAC to a common policy under general assumptions that hold even for deep neural network approximations. For more restrictive assumptions, we also prove that this common policy is a stationary point of an approximation of the original problem. Numerical results on multitask extensions of common continuous control benchmarks demonstrate that Diff-DAC stabilises learning and has a regularising effect that induces higher performance and better generalisation properties than previous architectures.


Sign in / Sign up

Export Citation Format

Share Document