Computing approximate Nash equilibria in general network revenue management games (Q296621): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2014.02.045 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2014.02.045 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077264097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of All Extreme Equilibria of Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical programming for network revenue management revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair revenue sharing mechanisms for strategic passenger airline alliances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate nucleolus-based revenue sharing in airline alliances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Settling the complexity of computing two-player Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on approximate Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5801631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An option-based revenue management procedure for strategic airline alliances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network capacity management under competition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of stochastic demand data streams for network revenue management problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network capacity control using self-adjusting bid-prices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for approximating Nash equilibria of bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium Points of Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Airline seat allocation competition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium points in <i>n</i> -person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revenue Management Games: Horizontal and Vertical Competition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the parity argument and other inefficient proofs of existence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3524712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Linear Programming Method for Computing Network Bid Prices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory and practice of revenue management / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2014.02.045 / rank
 
Normal rank

Latest revision as of 13:43, 9 December 2024

scientific article
Language Label Description Also known as
English
Computing approximate Nash equilibria in general network revenue management games
scientific article

    Statements

    Computing approximate Nash equilibria in general network revenue management games (English)
    0 references
    0 references
    0 references
    23 June 2016
    0 references
    network revenue management
    0 references
    competition
    0 references
    approximate Nash equilibria
    0 references
    algorithmic game theory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references