Result 1 to 20 of 78 total
Coordination mechanisms for parallel machine scheduling. (English)
Eur. J. Oper. Res. 220, No. 2, 305-313 (2012).
1
Efficiency of dual equilibria in selfish task allocation to selfish machines. (English)
Lin, Guohui (ed.), Combinatorial optimization and applications. 6th international conference, COCOA 2012, Banff, AB, Canada, August 5‒9, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31769-9/pbk). Lecture Notes in Computer Science 7402, 312-323 (2012).
2
Contention issues in congestion games. (English)
Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9‒13, 2012. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-31584-8/pbk). Lecture Notes in Computer Science 7392, 623-635 (2012).
3
Mobile network creation games. (English)
Even, Guy (ed.) et al., Structural information and communication complexity. 19th international colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30‒July 2, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-31103-1/pbk). Lecture Notes in Computer Science 7355, 159-170 (2012).
4
Stretch in bottleneck games. (English)
Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20‒22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 592-603 (2012).
5
Pairwise cooperations in selfish ring routing for minimax linear latency. (English)
Theor. Comput. Sci. 447, 26-37 (2012).
6
The price of anarchy on uniformly related machines revisited. (English)
Inf. Comput. 212, 37-54 (2012).
7
On the smoothed price of anarchy of the traffic assignment problem. (English)
Caprara, Alberto (ed.) et al., 11th workshop on algorithmic approaches for transportation modelling, optimization, and systems (ATMOS 2011). Selected papers based on the presentations at the workshop, September 8, 2011, Saarbrücken, Germany. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-33-0). OASIcs ‒ OpenAccess Series in Informatics 20, 122-133, electronic only (2011).
8
Non-cooperative spectrum access in cognitive radio networks: a game theoretical model. (English)
Comput. Netw. 55, No. 17, 3832-3846 (2011).
9
Coordination mechanisms with hybrid local policies. (English)
Discrete Optim. 8, No. 4, 513-524 (2011).
10
Selfish bin coloring. (English)
J. Comb. Optim. 22, No. 4, 531-548 (2011).
11
Price of anarchy in non-cooperative load balancing games. (English)
Perform. Eval. 68, No. 12, 1312-1332 (2011).
12
The price of forgetting in parallel and non-observable queues. (English)
Perform. Eval. 68, No. 12, 1291-1311 (2011).
13
Competition yields efficiency in load balancing games. (English)
Perform. Eval. 68, No. 11, 986-1001 (2011).
14
Stronger bounds on Braess’s paradox and the maximum latency of selfish routing. (English)
SIAM J. Discrete Math. 25, No. 4, 1667-1686 (2011).
15
Load balancing without regret in the bulletin board model. (English)
Distrib. Comput. 24, No. 1, 21-29 (2011).
16
Selfish bin covering. (English)
Theor. Comput. Sci. 412, No. 50, 7049-7058 (2011).
17
Tight bounds for selfish and greedy load balancing. (English)
Algorithmica 61, No. 3, 606-637 (2011).
18
Topological implications of selfish neighbor selection in unstructured peer-to-peer networks. (English)
Algorithmica 61, No. 2, 419-446 (2011).
19
Existence of anonymous link tolls for decentralizing an oligopolistic game and the efficiency analysis. (English)
J. Ind. Manag. Optim. 7, No. 2, 347-364 (2011).
20
Result 1 to 20 of 78 total
Start
Contact
Print
General Help
