SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Stackelberg scheduling strategies
16 references·16 citing·33 second hopsampled
Stackelberg scheduling strategies (2001)Stackelberg scheduling strategiesTight bounds for worst-case equilibria (2002)Tight bounds for worst-case e…How bad is selfish routing? (2002)How bad is selfish routing?Truthful mechanisms for one-parameter agents (2001)Truthful mechanisms for one-p…Algorithmic Mechanism Design (2001)Algorithmic Mechanism DesignWorst-Case Equilibria (1999)Worst-Case EquilibriaAlgorithmic mechanism design (extended abstract) (1999)Algorithmic mechanism design …Dynamic Noncooperative Game Theory, 2nd Edition (1998)Dynamic Noncooperative Game T…Capacity allocation under noncooperative routing (1997)Capacity allocation under non…Achieving network optima using Stackelberg routing strategies (1997)Achieving network optima usin…Competitive routing in multiuser communication networks (1993)Competitive routing in multiu…Urban transportation networks: Equilibrium analysis with mathematical programming methods (1986)Urban transportation networks…Inefficiency of Nash Equilibria (1986)Inefficiency of Nash Equilibr…Dynamic Noncooperative Game Theory (1982)Dynamic Noncooperative Game T…Traffic assignment problem for a general network (1969)Traffic assignment problem fo…Studies in the Economics of Transportation. (1956)Studies in the Economics of T…Marktform und Gleichgewicht. (1935)Marktform und Gleichgewicht.Selfish Yet Optimal Routing by Adjusting Perceived Traffic Information of Road Networks (2020)Selfish Yet Optimal Routing b…Stackelberg Routing on Parallel Networks With Horizontal Queues (2014)Stackelberg Routing on Parall…Game-theoretic routing of GPS-assisted vehicles for energy efficiency (2011)Game-theoretic routing of GPS…Learning and Approximating the Optimal Strategy to Commit To (2009)Learning and Approximating th…Statistical Properties of Individual Choice Behaviors on Urban Traffic Networks (2008)Statistical Properties of Ind…Almost) optimal coordination mechanisms for unrelated machine scheduling (2008)Almost) optimal coordination …Mixed Travel Behavior in Networks with ATIS and Upper Bound of Efficiency Loss (2007)Mixed Travel Behavior in Netw…An efficient heuristic approach for security against multiple adversaries (2007)An efficient heuristic approa…A network pricing game for selfish traffic (2007)A network pricing game for se…When selfish meets evil (2006)When selfish meets evilFast convergence to Wardrop equilibria by adaptive sampling methods (2006)Fast convergence to Wardrop e…Coordination Mechanisms for Selfish Scheduling (2005)Coordination Mechanisms for S…A network pricing game for selfish traffic (2005)A network pricing game for se…Selfish Routing on the Internet. (2004)Selfish Routing on the Intern…Nash Equilibria in Discrete Routing Games with Convex Latency Functions (2004)Nash Equilibria in Discrete R…Selfish traffic allocation for server farms (2002)Selfish traffic allocation fo…COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)Optimal Auction Design (1981)A Course in Game Theory (1994)Truth revelation in approximately efficient combinatorial auctions (2002)A survey on networking games in telecommunications (2004)Worst-case equilibria (2009)Existence and Uniqueness of Equilibrium Points for Concave N-Person Games (1965)The price of anarchy is independent of the network topology (2003)Games and Decisions (2015)Social Choice and Individual Values. (1951)Towards a characterization of truthful combinatorial auctions (2004)Truthful approximation mechanisms for restricted combinatorial auctions (2008)Approximate mechanism design without money (2009)Algorithms, games, and the internet (2001)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)The Price of Fairness (2011)Models and algorithms for road network design: a review and some new developments (1998)Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future (2001)Selfish Routing and the Price of Anarchy (2016)The Voracity Effect (1999)Large population stochastic dynamic games: closed-loop McKean-Vlasov systems and the Nash certainty equivalence principle (2006)Coalitional game theory for communication networks (2009)A probabilistic multipath traffic assignment model which obviates path enumeration (1971)Traffic Equilibrium and Variational Inequalities (1980)The complexity of pure Nash equilibria (2004)THEORIES OF THE FIRM: MARGINALIST, BEHAVIORAL, MANAGERIAL (1978)The Theory of Business Strategy (1989)Computing the optimal strategy to commit to (2006)Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness (2011)Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness (2011)Mean Field Games and systemic risk (2015)An efficient approach to solving the road network equilibrium traffic assignment problem (1975)The existence, uniqueness and stability of traffic equilibria (1979)
this work references cited by second hop· second hop is a sample of the most-cited connections

References

  • 1982Dynamic Noncooperative Game Theory4,057 cited
  • 1986Urban transportation networks: Equilibrium analysis with mathematical programming methods2,352 cited
  • 1999Worst-Case Equilibria1,962 cited
  • 1956Studies in the Economics of Transportation.1,614 cited
  • 2001Algorithmic Mechanism Design1,331 cited
  • 1998Dynamic Noncooperative Game Theory, 2nd Edition1,185 cited
  • 1935Marktform und Gleichgewicht.1,037 cited
  • 1969Traffic assignment problem for a general network688 cited
  • 1993Competitive routing in multiuser communication networks555 cited
  • 2001Truthful mechanisms for one-parameter agents521 cited
  • 1999Algorithmic mechanism design (extended abstract)478 cited
  • 1986Inefficiency of Nash Equilibria332 cited
  • 1997Achieving network optima using Stackelberg routing strategies316 cited
  • 2002How bad is selfish routing?277 cited
  • 2002Tight bounds for worst-case equilibria195 cited
  • 1997Capacity allocation under noncooperative routing148 cited

Cited by

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

  • 2009Learning and Approximating the Optimal Strategy to Commit To122 cited
  • 2006When selfish meets evil120 cited
  • 2007An efficient heuristic approach for security against multiple adversaries119 cited
  • 2002Selfish traffic allocation for server farms97 cited
  • 2006Fast convergence to Wardrop equilibria by adaptive sampling methods96 cited
  • 2008Almost) optimal coordination mechanisms for unrelated machine scheduling82 cited
  • 2007A network pricing game for selfish traffic59 cited
  • 2005A network pricing game for selfish traffic55 cited
  • 2004Nash Equilibria in Discrete Routing Games with Convex Latency Functions55 cited
  • 2005Coordination Mechanisms for Selfish Scheduling46 cited
  • 2014Stackelberg Routing on Parallel Networks With Horizontal Queues42 cited
  • 2004Selfish Routing on the Internet.41 cited
  • 2011Game-theoretic routing of GPS-assisted vehicles for energy efficiency22 cited
  • 2007Mixed Travel Behavior in Networks with ATIS and Upper Bound of Efficiency Loss19 cited
  • 2008Statistical Properties of Individual Choice Behaviors on Urban Traffic Networks7 cited
  • 2020Selfish Yet Optimal Routing by Adjusting Perceived Traffic Information of Road Networks6 cited