EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"acyclic permission structure"
Narrow search

Narrow search

Year of publication
Subject
All
TU-game 4 acyclic permission structure 4 additive game 4 algorithm 4 complexity 4 disjunctive approach 4 nucleolus 4 peer group game 4 Algorithmus 2 Core 2 Kooperatives Spiel 2 Algorithm 1 Cooperative game 1 Game theory 1 Gruppenentscheidung 1 Spieltheorie 1 Theorie 1 Transferable Utility Games 1 Transferable utility 1 Transferierbarer Nutzen 1
more ... less ...
Online availability
All
Free 4
Type of publication
All
Book / Working Paper 4
Type of publication (narrower categories)
All
Working Paper 2 Arbeitspapier 1 Graue Literatur 1 Non-commercial literature 1
Language
All
English 2 Undetermined 2
Author
All
Katsev, Ilya 4 Brink, René van den 3 Laan, Gerard van der 3 van den Brink, René 1 van der Laan, Gerard 1
Institution
All
Tinbergen Institute 1 Tinbergen Instituut 1
Published in...
All
Tinbergen Institute Discussion Papers 2 Discussion paper / Tinbergen Institute 1 Tinbergen Institute Discussion Paper 1
Source
All
RePEc 2 ECONIS (ZBW) 1 EconStor 1
Showing 1 - 4 of 4
Cover Image
An Algorithm for Computing the Nucleolus of Disjunctive Additive Games with An Acyclic Permission Structure
van den Brink, René; Katsev, Ilya; van der Laan, Gerard - 2008
consider the class of non-negative additive games with an acyclic permission structure. This class generalizes the so … permission structure. We discuss an application to market situations where sellers can sell objects to buyers through a directed … computing the nucleolus of every restricted game corresponding to some disjunctive non-negative additive game with an acyclic …
Persistent link: https://www.econbiz.de/10010325798
Saved in:
Cover Image
An Algorithm for Computing the Nucleolus of Disjunctive Additive Games with An Acyclic Permission Structure
Brink, René van den; Katsev, Ilya; Laan, Gerard van der - Tinbergen Instituut - 2008
consider the class of non-negative additive games with an acyclic permission structure. This class generalizes the so … permission structure. We discuss an application to market situations where sellers can sell objects to buyers through a directed … computing the nucleolus of every restricted game corresponding to some disjunctive non-negative additive game with an acyclic …
Persistent link: https://www.econbiz.de/10011257037
Saved in:
Cover Image
An Algorithm for Computing the Nucleolus of Disjunctive Additive Games with An Acyclic Permission Structure
Brink, René van den; Katsev, Ilya; Laan, Gerard van der - Tinbergen Institute - 2008
consider the class of non-negative additive games with an acyclic permission structure. This class generalizes the so … permission structure. We discuss an application to market situations where sellers can sell objects to buyers through a directed … computing the nucleolus of every restricted game corresponding to some disjunctive non-negative additive game with an acyclic …
Persistent link: https://www.econbiz.de/10005144441
Saved in:
Cover Image
An algorithm for computing the nucleolus of disjunctive additive games with an acyclic permission structure
Brink, René van den; Katsev, Ilya; Laan, Gerard van der - 2008
consider the class of non-negative additive games with an acyclic permission structure. This class generalizes the so … permission structure. We discuss an application to market situations where sellers can sell objects to buyers through a directed … computing the nucleolus of every restricted game corresponding to some disjunctive non-negative additive game with an acyclic …
Persistent link: https://www.econbiz.de/10011377258
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...