Strategic Pricing in Next-Hop Routing with Elastic Demands.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 3, p. 407, doi. 10.1007/s00224-012-9435-y
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2014 AND VI 54 AND IP 3
Results: 8
1
2
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 3, p. 388, doi. 10.1007/s00224-013-9449-0
- By:
- Publication type:
- Article
3
Weakly-Acyclic (Internet) Routing Games.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 3, p. 431, doi. 10.1007/s00224-013-9474-z
- By:
- Publication type:
- Article
4
Repeated Budgeted Second Price Ad Auction.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 3, p. 453, doi. 10.1007/s00224-013-9472-1
- By:
- Publication type:
- Article
5
Complexity of Rational and Irrational Nash Equilibria.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 3, p. 491, doi. 10.1007/s00224-013-9523-7
- By:
- Publication type:
- Article
6
Scheduling Without Payments.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 3, p. 375, doi. 10.1007/s00224-013-9473-0
- By:
- Publication type:
- Article
7
Special Issue on Algorithmic Game Theory.
- Published in:
- 2014
- By:
- Publication type:
- Editorial
8
Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof).
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 3, p. 479, doi. 10.1007/s00224-013-9446-3
- By:
- Publication type:
- Article