Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting (Q2020618): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-020-01495-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3017263481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg bipartite vertex cover and the preflow algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specializations and generalizations of the Stackelberg minimum spanning tree game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stackelberg pricing with computationally bounded customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg network pricing games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2943937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stackelberg minimum spanning tree game / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic and Nonuniform Pricing Strategies for Revenue Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering a Function from a Dini Derivative / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg network pricing is hard to approximate / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for Stackelberg network pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of Stackelberg pricing in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4610958 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:23, 25 July 2024

scientific article
Language Label Description Also known as
English
Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting
scientific article

    Statements

    Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting (English)
    0 references
    0 references
    0 references
    0 references
    23 April 2021
    0 references
    algorithmic pricing
    0 references
    Stackelberg games
    0 references
    approximation algorithms
    0 references
    revenue maximization
    0 references
    parameterized complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references