×

Found 180 Documents (Results 1–100)

Approximation algorithms for stochastic orienteering. (English) Zbl 1423.90106

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1522-1538 (2012).

Approximation algorithms for the unsplittable flow problem on paths and trees. (English) Zbl 1354.68297

D’Souza, Deepak (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2012). Selected papers based on the presentations at the 32nd conference, Hyderabad, India, December 15–17, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-47-7). LIPIcs – Leibniz International Proceedings in Informatics 18, 267-275 (2012).
Full Text: DOI

Network formation in competition model. (English) Zbl 1347.91098

Petrosyan, Leon A. (ed.) et al., Contributions to game theory and management. Volume V. The 5th international conference game theory and management (GTM 2010), June 27–29, 2011, St. Petersburg, Russia. Collected papers. St. Petersburg: Graduate School of Management, St. Petersburg University (ISBN 978-5-9924-0075-5/pbk). 286-292 (2012).
Full Text: MNR

Multicommodity flows and cuts in polymatroidal networks. (English) Zbl 1347.68278

Proceedings of the 3rd conference on innovations in theoretical computer science, ITCS’12, Cambridge, MA, USA, January 8–10, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1115-1). 399-408 (2012).

Brief announcement: Network formation games can give rise to realistic networks. (English) Zbl 1301.68033

Proceedings of the 2012 ACM symposium on principles of distributed computing, PODC ’12, Funchal, Portugal, July 16–18, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1450-3). 329-330 (2012).
Full Text: DOI

Brief announcement: Breaking the \(O(nm)\) bit barrier, secure multiparty computation with a static adversary. (English) Zbl 1301.68251

Proceedings of the 2012 ACM symposium on principles of distributed computing, PODC ’12, Funchal, Portugal, July 16–18, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1450-3). 227-228 (2012).
Full Text: DOI

Mean field analysis for inhomogeneous bike sharing systems. (English) Zbl 1296.90019

Broutin, Nicolas (ed.) et al., Proceeding of the 23rd international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA’12), Montreal, Canada, June 18–22, 2012. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 365-376, electronic only (2012).
MSC:  90B15 60F17 60K30

Towards a metric for communication network vulnerability to attacks: a game theoretic approach. (English) Zbl 1268.91037

Krishnamurthy, Vikram (ed.) et al., Game theory for networks. Third international ICST conference, GameNets 2012, Vancouver, Canada, May 24–26, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-35581-3/pbk; 978-3-642-35582-0/ebook). Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 105, 259-274 (2012).
MSC:  91A80 90B18
Full Text: DOI

Stochastic loss aversion for random medium access. (English) Zbl 1268.91039

Krishnamurthy, Vikram (ed.) et al., Game theory for networks. Third international ICST conference, GameNets 2012, Vancouver, Canada, May 24–26, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-35581-3/pbk; 978-3-642-35582-0/ebook). Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 105, 236-247 (2012).

A Stackelberg game to optimize the distribution of controls in transportation networks. (English) Zbl 1268.91034

Krishnamurthy, Vikram (ed.) et al., Game theory for networks. Third international ICST conference, GameNets 2012, Vancouver, Canada, May 24–26, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-35581-3/pbk; 978-3-642-35582-0/ebook). Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 105, 224-235 (2012).
Full Text: DOI

Game-theoretic robustness of many-to-one networks. (English) Zbl 1268.91042

Krishnamurthy, Vikram (ed.) et al., Game theory for networks. Third international ICST conference, GameNets 2012, Vancouver, Canada, May 24–26, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-35581-3/pbk; 978-3-642-35582-0/ebook). Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 105, 88-98 (2012).
MSC:  91A80 91A43 90B18

Incentives and security in electricity distribution networks. (English) Zbl 1377.91047

Grossklags, Jens (ed.) et al., Decision and game theory for security. Third international conference, GameSec 2012, Budapest, Hungary, November 5–6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-34265-3/pbk). Lecture Notes in Computer Science 7638, 264-280 (2012).
Full Text: DOI

A game-theoretic framework for network security vulnerability assessment and mitigation. (English) Zbl 1377.90013

Grossklags, Jens (ed.) et al., Decision and game theory for security. Third international conference, GameSec 2012, Budapest, Hungary, November 5–6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-34265-3/pbk). Lecture Notes in Computer Science 7638, 186-200 (2012).
MSC:  90B10 91A40 91A80
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 3

Main Field