Found: 27
Select item for more details and to access through your institution.
The Price of Anarchy for Instantaneous Dynamic Equilibria.
- Published in:
- Mathematics of Operations Research, 2023, v. 48, n. 4, p. 2167, doi. 10.1287/moor.2022.1336
- By:
- Publication type:
- Article
Efficient Black-Box Reductions for Separable Cost Sharing.
- Published in:
- Mathematics of Operations Research, 2021, v. 46, n. 1, p. 134, doi. 10.1287/moor.2020.1050
- By:
- Publication type:
- Article
Matroids Are Immune to Braess' Paradox.
- Published in:
- Mathematics of Operations Research, 2017, v. 42, n. 3, p. 745, doi. 10.1287/moor.2016.0825
- By:
- Publication type:
- Article
Congestion Games with Variable Demands.
- Published in:
- Mathematics of Operations Research, 2016, v. 41, n. 1, p. 255, doi. 10.1287/moor.2015.0726
- By:
- Publication type:
- Article
Optimal Cost Sharing for Resource Selection Games.
- Published in:
- Mathematics of Operations Research, 2013, v. 38, n. 1, p. 184, doi. 10.1287/moor.1120.0567
- By:
- Publication type:
- Article
On the Existence of Pure Nash Equilibria in Weighted Congestion Games.
- Published in:
- Mathematics of Operations Research, 2012, v. 37, n. 3, p. 419, doi. 10.1287/moor.1120.0543
- By:
- Publication type:
- Article
Stackelberg Routing in Arbitrary Networks.
- Published in:
- Mathematics of Operations Research, 2010, v. 35, n. 2, p. 330, doi. 10.1287/moor.1100.0442
- By:
- Publication type:
- Article
Preface to Special Issue on Algorithmic Game Theory.
- Published in:
- 2015
- By:
- Publication type:
- Editorial
Characterizing the Existence of Potential Functions in Weighted Congestion Games.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 1, p. 46, doi. 10.1007/s00224-011-9315-x
- By:
- Publication type:
- Article
Stackelberg Strategies and Collusion in Network Games with Splittable Flow.
- Published in:
- Theory of Computing Systems, 2011, v. 48, n. 4, p. 781, doi. 10.1007/s00224-010-9269-4
- By:
- Publication type:
- Article
Competitive Online Multicommodity Routing.
- Published in:
- Theory of Computing Systems, 2009, v. 45, n. 3, p. 533, doi. 10.1007/s00224-009-9187-5
- By:
- Publication type:
- Article
Computing network tolls with support constraints.
- Published in:
- Networks, 2015, v. 65, n. 3, p. 262, doi. 10.1002/net.21604
- By:
- Publication type:
- Article
Strong equilibria in games with the lexicographical improvement property.
- Published in:
- International Journal of Game Theory, 2013, v. 42, n. 2, p. 461, doi. 10.1007/s00182-012-0322-1
- By:
- Publication type:
- Article
Correction to: Broadcasting a file in a communication network.
- Published in:
- 2022
- By:
- Publication type:
- Correction Notice
Broadcasting a file in a communication network.
- Published in:
- Journal of Scheduling, 2020, v. 23, n. 2, p. 211, doi. 10.1007/s10951-020-00643-w
- By:
- Publication type:
- Article
An Integrated Approach to Tactical Transportation Planning in Logistics Networks.
- Published in:
- Transportation Science, 2016, v. 50, n. 2, p. 439, doi. 10.1287/trsc.2014.0541
- By:
- Publication type:
- Article
Fare Evasion in Transit Networks.
- Published in:
- Operations Research, 2017, v. 65, n. 1, p. 165, doi. 10.1287/opre.2016.1560
- By:
- Publication type:
- Article
The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games.
- Published in:
- Operations Research, 2011, v. 59, n. 6, p. 1491, doi. 10.1287/opre.1110.0979
- By:
- Publication type:
- Article
Prediction Equilibrium for Dynamic Network Flows.
- Published in:
- Journal of Machine Learning Research, 2023, v. 24, p. 1
- By:
- Publication type:
- Article
Stackelberg pricing games with congestion effects.
- Published in:
- Mathematical Programming, 2024, v. 203, n. 1/2, p. 763, doi. 10.1007/s10107-021-01672-9
- By:
- Publication type:
- Article
A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows.
- Published in:
- Mathematical Programming, 2023, v. 197, n. 2, p. 761, doi. 10.1007/s10107-022-01772-0
- By:
- Publication type:
- Article
Correction to: Equilibrium computation in resource allocation games.
- Published in:
- Mathematical Programming, 2022, v. 194, n. 1/2, p. 35, doi. 10.1007/s10107-022-01813-8
- By:
- Publication type:
- Article
Equilibrium computation in resource allocation games.
- Published in:
- Mathematical Programming, 2022, v. 194, n. 1/2, p. 1, doi. 10.1007/s10107-020-01604-z
- By:
- Publication type:
- Article
Dynamic flows with adaptive route choice.
- Published in:
- Mathematical Programming, 2020, v. 183, n. 1/2, p. 309, doi. 10.1007/s10107-020-01504-2
- By:
- Publication type:
- Article
Computing pure Nash and strong equilibria in bottleneck congestion games.
- Published in:
- Mathematical Programming, 2013, v. 141, n. 1/2, p. 193, doi. 10.1007/s10107-012-0521-3
- By:
- Publication type:
- Article
Pure Nash Equilibria in Resource Graph Games.
- Published in:
- Journal of Artificial Intelligence Research, 2021, v. 72, p. 185, doi. 10.1613/jair.1.12668
- By:
- Publication type:
- Article
Constrained Resource Assignments: Fast Algorithms and Applications in Wireless Networks.
- Published in:
- Management Science, 2016, v. 62, n. 7, p. 2070, doi. 10.1287/mnsc.2015.2221
- By:
- Publication type:
- Article