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

Parameterized fairness axioms on cycle-free graph games

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

DOI10.1007/s10898-011-9761-7zbMath1243.91007OpenAlexW2069793843MaRDI QIDQ427375

Yoshitsugu Yamamoto, S. Ryuo, Keisuke Sato

Publication date: 13 June 2012

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://tsukuba.repo.nii.ac.jp/record/27078/files/JGO_52-3.pdf


zbMATH Keywords

fairnessTU-gamecommunication structurecycle-free graph


Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)




Cites Work

  • Pareto optimality, game theory and equilibria
  • Conference structures and fair allocation rules
  • The average tree solution for cooperative games with communication structure
  • The average tree solution for cycle-free graph games
  • A characterization of the position value
  • On the Position Value for Communication Situations
  • Graphs and Cooperation in Games
  • AVERAGE TREE SOLUTION AND SUBCORE FOR ACYCLIC GRAPH GAMES
  • A one-stage model of link formation and payoff division
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Parameterized fairness axioms on cycle-free graph games

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