Result 1 to 18 of 18 total
A polyhedral study of the maximum edge subgraph problem. (English)
Discrete Appl. Math. 160, No. 18, 2573-2590 (2012).
1
Stochastic selfish routing. (English)
Persiano, Giuseppe (ed.), Algorithmic game theory. 4th international symposium, SAGT 2011, Amalfi, Italy, October 17‒19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24828-3/pbk). Lecture Notes in Computer Science 6982, 314-325 (2011).
2
The cost of moral hazard and limited liability in the principal-agent problem. (English)
Saberi, Amin (ed.), Internet and network economics. 6th international workshop, WINE 2010, Stanford, CA, USA, December 13‒17, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17571-8/pbk). Lecture Notes in Computer Science 6484, 63-74 (2010).
3
Efficient and fair routing for mesh networks. (English)
Math. Program. 124, No. 1-2 (B), 285-316 (2010).
4
In-home and remote QoS control for home networks (English)
NOMS, 163-170 (2010).
5
Automated real-time recommendations for IPTV (English)
ICC, 1-6 (2009).
6
A geometric approach to the price of anarchy in nonatomic congestion games. (English)
Games Econ. Behav. 64, No. 2, 457-469 (2008).
7
Fast, fair, and efficient flows in networks. (English)
Oper. Res. 55, No. 2, 215-225 (2007).
8
Robust Wardrop equilibrium. (English)
Chahed, Tijani (ed.) et al., Network control and optimization. First EuroFGI international conference, NET-COOP 2007, Avignon, France, June 5‒7, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72708-8/pbk). Lecture Notes in Computer Science 4465, 247-256 (2007).
9
A note on the precedence-constrained class sequencing problem. (English)
Discrete Appl. Math. 155, No. 3, 257-259 (2007).
10
Network games with atomic players. (English)
Bugliesi, Michele (ed.) et al., Automata, languages and programming. 33rd international colloquium, ICALP 2006, Venice, Italy, July 10‒14, 2006. Proceedings, Part I. Berlin: Springer (ISBN 978-3-540-35904-3/pbk). Lecture Notes in Computer Science 4051, 525-536 (2006).
11
Efficiency and fairness of system-optimal routing with user constraints. (English)
Networks 48, No. 4, 223-234 (2006).
12
A practical approach to SIP, QoS and AAA integration (English)
Networking, 654-665 (2006).
13
System-optimal routing of traffic flows with user constraints in networks with congestion. (English)
Oper. Res. 53, No. 4, 600-616 (2005).
14
On the inefficiency of equilibria in congestion games (extended abstract). (English)
Jünger, Michael (ed.) et al., Integer programming and combinatorial optimization. 11th international IPCO conference, Berlin, Germany, June 8‒10, 2005. Proceedings. Berlin: Springer (ISBN 978-3-540-26199-5/pbk). Lecture Notes in Computer Science 3509, 167-181 (2005).
15
Computational complexity, fairness, and the price of anarchy of the maximum latency problem. (English)
Bienstock, Daniel (ed.) et al., Integer programming and combinatorial optimization. 10th international IPCO conference, New York, NY, USA, June 7‒11, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22113-1/pbk). Lecture Notes in Computer Science 3064, 59-73 (2004).
16
Selfish routing in capacitated networks. (English)
Math. Oper. Res. 29, No. 4, 961-976 (2004).
17
On the performance of user equilibria in traffic networks. (English)
Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, Baltimore, MD, USA, January 12‒14, 2003. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics (ISBN 0-89871-538-5/pbk). 86-87 (2003).
18
Result 1 to 18 of 18 total
Start
Contact
Print
General Help
