Skip to main navigation Skip to main content
info(at)avldigital.remove-this.de
Deutsch English
Last searches

Results for *

Displaying results 1 to 7 of 7.

  1. Robust balanced optimization
    Author: Ficker, Annette M. C.; Spieksma, Frits C. R.; Woeginger, Gerhard J.
    Published: [2018]
    Publisher:  KU Leuven, Faculty of Economics and Business, Leuven, België

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Inter-library loan:
    No inter-library loan
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Series: KBI ; KBI_18, 02
    Subjects: balanced optimization; assignment problem; computational complexity; approximation
    Scope: 1 Online-Ressource (circa 34 Seiten)
  2. The transportation problem with conflicts
    Author: Ficker, Annette M. C.; Spieksma, Frits C. R.; Woeginger, Gerhard J.
    Published: [2017]
    Publisher:  KU Leuven, Faculty of Economics and Business, Leuven, België

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Inter-library loan:
    No inter-library loan
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Volltext (kostenfrei)
    Volltext (kostenfrei)
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Series: KBI ; KBI_17, 19
    Subjects: Transportation problem; conflict graph; computational complexity; approximation
    Scope: 1 Online-Ressource (circa 25 Seiten), Illustrationen
  3. On the revealed preference analysis of stable aggregate matchings
    Author: Demuynck, Thomas; Salman, Umutcan
    Published: September 2020
    Publisher:  ECARES, Brussels, Belgium

    Access:
    Verlag (kostenfrei)
    Resolving-System (kostenfrei)

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    VS 313
    Inter-library loan:
    No inter-library loan
    Export to reference management software   RIS file
      BibTeX file
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/312868
    Series: ECARES working paper ; 2020, 42
    Subjects: Revealed preference theory; two-sided matching markets; stability; computational complexity
    Scope: 1 Online-Ressource (circa 41 Seiten), Illustrationen
  4. On the approximability of the fixed-tree balanced minimum evolution problem
    Author: Frohn, Martin
    Published: [2021]
    Publisher:  CORE, Louvain-la-Neuve

    Access:
    Verlag (kostenfrei)
    Resolving-System (kostenfrei)

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    VS 203
    Inter-library loan:
    No inter-library loan
    Export to reference management software   RIS file
      BibTeX file
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 2078.1/254571
    Series: LIDAM discussion paper CORE ; 2021, 20
    Subjects: Fixed-tree balanced minimum evolution problem; computational complexity; phylogenetics
    Scope: 1 Online-Ressource (circa 7 Seiten), Illustrationen
  5. Computational complexity in additive hedonic games
    Author: Sung, Shao Chin; Dimitrov, Dinko
    Published: 2008
    Publisher:  Univ., Volkswirtschaftl. Fak., München

    We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either... more

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 483 (2008,18)
    Inter-library loan:
    No inter-library loan

    Location:
    Universitätsbibliothek Mannheim
    Inter-library loan:
    No inter-library loan

     

    We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under consideration, the existence problem of a stable coalition structure is NP-hard in the strong sense. Furthermore, the corresponding decision problems with respect to the existence of a Nash stable coalition structure and of an individually stable coalition structure turn out to be NP-complete in the strong sense.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Other identifier:
    hdl: 10419/104274
    Series: Münchener wirtschaftswissenschaftliche Beiträge ; 2008-18
    Subjects: Koalition; Entscheidungstheorie; Nash-Gleichgewicht; Core; Nichtlineare Optimierung; Komplexe Systeme; Theorie; additive preferences; coalition formation; computational complexity; hedonic games; NP-hard; NP-complete
    Scope: Online-Ressource (32 S., 187 KB), Ill.
  6. Conference scheduling
    a personalized approach
    Author: Vangerven, B.; Ficker, A.; Goossens, Dries; Passchyn, W.; Spieksma, Frits C. R.; Woeginger, Gerhard J.
    Published: Mar-2017
    Publisher:  KU Leuven, Faculty of Economics and Business, Leuven, België

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Inter-library loan:
    No inter-library loan
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Source: Union catalogues
    Language: English
    Media type: Book
    Format: Online
    Series: KBI ; KBI_17, 04
    Subjects: conference scheduling; computational complexity; case study; integer programming
    Scope: 1 Online-Ressource (circa 14 Seiten)
  7. Efficient formulas and computational efficiency for glove games
    Author: Belau-Garmann, Julia
    Published: 2013
    Publisher:  RWI, Essen

    A well known and simple game to model markets is the glove game where worth is produced by building matching pairs. For glove games, different concepts, like the Shapley value, the restricted Shapley value or the Owen value, yield different... more

    Location:
    Niedersächsische Staats- und Universitätsbibliothek Göttingen
    Inter-library loan:
    No inter-library loan

    Location:
    Staats- und Universitätsbibliothek Hamburg Carl von Ossietzky
    Inter-library loan:
    No inter-library loan

    Location:
    ZBW - Leibniz-Informationszentrum Wirtschaft, Standort Kiel
    Signature:
    DS 10 (456)
    Inter-library loan:
    No inter-library loan

     

    A well known and simple game to model markets is the glove game where worth is produced by building matching pairs. For glove games, different concepts, like the Shapley value, the restricted Shapley value or the Owen value, yield different distributions of worth. Moreover, computational effort of these values is in general very high. This paper provides efficient allocation formulas of the component restricted Shapley value and the Owen value for glove games in case of efficient coalitions.

     
    Export to reference management software   RIS file
      BibTeX file
    Content information
    Source: Union catalogues
    Language: English
    Media type: Ebook
    Format: Online
    ISBN: 9783867885157
    Other identifier:
    hdl: 10419/88749
    Series: Ruhr economic papers ; 456
    Subjects: Glove game; imbalanced market; Shapley value; Owen value; efficiency; computational complexity
    Scope: Online-Ressource (10 S.)
    Notes:

    Zsfassung in dt. Sprache