A simple and procedurally fair game form for Nash implementation of the No-envy solution
type: Item
instance of: scholarly article
title: A simple and procedurally fair game form for Nash implementation of the No-envy solution
author: Makoto Hagiwara
publication date: 2022-11-22T00:00:00Z
Mathematics Subject Classification ID: 91B32
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 7622135
zbMATH Keywords: Nash implementation
zbMATH Keywords: no-envy solution
zbMATH Keywords: procedural fairness
zbMATH Keywords: simple game form
MaRDI profile type: Publication
full work available at URL: bejte-2019-0051
OpenAlex ID: W2972994405
Wikidata QID: Q127243312
cites work: The uniform rule with several commodities: a generalization of Sprumont's characterization
cites work: Symmetric mechanism design
cites work: Secure implementation experiments: Do strategy-proof mechanisms really work?
cites work: Nash-implementation of the no-envy solution on symmetric domains of economies
cites work: Fair divisions as attracting Nash equilibria of simple games
cites work: A general concept of procedural fairness for one-stage implementation
cites work: Procedurally fair implementation under complete information
cites work: A characterization of the uniform rule with several commodities and agents
cites work: Strategy Space Reduction in Maskin's Theorem: Sufficient Conditions for Nash Implementation
cites work: Toward Natural Implementation
cites work: The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule
cites work: Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness
cites work: Divide-and-permute
cites work: Children crying at birthday parties. Why?
cites work: Implementation of solutions to the problem of fair division when preferences are single-peaked
cites work: On Nash implementation of social choice correspondences
DOI: 10.1515/BEJTE-2019-0051
Recommended article: Nash-implementation of the no-envy solution on symmetric domains of economies
Recommended article: Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems
Recommended article: Implementation in undominated Nash equilibria without integer games
Recommended article: Fair by design: multidimensional envy-free mechanisms
Recommended article: Implementing egalitarianism in a class of Nash demand games
Recommended article: Approximate envy-free procedures
Recommended article: Implementation Via Nash Equilibria
Recommended article: Nash-implementation of competitive equilibria via a bounded mechanism
Recommended article: On Multi-dimensional Envy-Free Mechanisms
Recommended article: Mechanisms and Impossibilities for Truthful, Envy-Free Allocations
published in: The B.E. Journal of Theoretical Economics
description: scientific article; zbMATH DE number 7622135