Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Top-pair and top-triple monotonicity

From MaRDI portal
Publication:2431836
Jump to:navigation, search

DOI10.1007/s00355-006-0119-xzbMath1180.91112OpenAlexW2058073069MaRDI QIDQ2431836

Arunava Sen, Dipjyoti Majumdar

Publication date: 24 October 2006

Published in: Social Choice and Welfare (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00355-006-0119-x



Mathematics Subject Classification ID

Social choice (91B14)


Related Items (1)

Characterizing the resolute part of monotonic social choice correspondences



Cites Work

  • Unnamed Item
  • Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
  • Dictatorial domains
  • Arrow's theorem and the Gibbard-Satterthwaite theorem: A unified approach
  • Monotonicity implies generalized strategy-proofness for correspondences
  • Manipulation of Voting Schemes: A General Result
  • Nash Equilibrium and Welfare Optimality


This page was built for publication: Top-pair and top-triple monotonicity

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2431836&oldid=15104022"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 2 February 2024, at 22:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki