EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Search
 Organisation

EEMCS EPrints Service


Classification: MSC-90C27
Home Policy Brochure Browse Search User Area Contact Help

2016

de Jong, J. and Klimm, M. and Uetz, M.J. (2016) Efficiency of equilibria in uniform matroid congestion games. Technical Report TR-CTIT-16-04, Centre for Telematics and Information Technology, University of Twente, Enschede. ISSN 1381-3625
de Jong, J. and Klimm, M. and Uetz, M.J. (2016) Efficiency of equilibria in uniform matroid congestion games. In: Proceedings of the 9th International Symposium on Algorithmic Game Theory (SAGT 2016), 19-21 Sept 2016, Liverpool, UK. pp. 105-116. Lecture Notes in Computer Science 9928. Springer Verlag. ISSN 0302-9743 ISBN 978-3-662-53353-6

2015

Correa, J. and de Jong, J. and de Keijzer, B. and Uetz, M.J. (2015) The curse of sequentiality in routing games. Technical Report TR-CTIT-15-07, Centre for Telematics and Information Technology, University of Twente, Enschede. ISSN 1381-3625
Correa, J. and de Jong, J. and de Keijzer, B. and Uetz, M.J. (2015) The curse of sequentiality in routing games. In: 11th International Conference on Web and Internet Economics, WINE 2015, 09-12 Dec 2015, Amsterdam, The Netherlands. pp. 258-271. Lecture Notes in Computer Science 9470. Springer Verlag. ISSN 0302-9743 ISBN 978-3-662-48994-9
Duives, J. and Heydenreich, B. and Mishra, D. and Müller, R. and Uetz, M.J. (2015) On optimal mechanism design for a sequencing problem. Journal of Scheduling, 18 (1). pp. 45-59. ISSN 1094-6136 *** ISI Impact 1,023 ***
Müller, R. and Uetz, M.J. (2015) Shortest Path to Mechanism Design. In: Gems of Combinatorial Optimization and Graph Algorithms. Springer Verlag, Berlin, pp. 83-94. ISBN 978-3319249704

2012

Faigle, U. and Kern, W. and Peis, B. (2012) A ranking model for the greedy algorithm and discrete convexity. Mathematical programming, 132 (1-2). pp. 393-407. ISSN 0025-5610 *** ISI Impact 2,062 ***

2007

Kern, W. and Woeginger, G.J. (2007) Quadratic programming and combinatorial minimum weight product problems. Mathematical programming, 110 (3). pp. 641-649. ISSN 0025-5610 *** ISI Impact 2,062 ***

2006

Faigle, U. and Kern, W. and Kuipers, J. (2006) Computing an element in the lexicographic kernel of a game. Mathematical methods of operations research, 63 (3). pp. 427-433. ISSN 1432-2994 *** ISI Impact 0,526 ***

2004

Boucherie, R.J. and Bumb, A.F. and Endrayanto, A.I. and Woeginger, G.J. (2004) A combinatorial approximation algorithm for CDMA downlink rate allocation. Memorandum 1724, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

2002

Faigle, U. and Kern, W. and Kuipers, J. (2002)
Computing an element in the lexicographic kernel of a game.
Memorandum 1663, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Kern, W. and Paulusma, D. (2002)
The generalized sports competition problem.
Memorandum 1620, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

2001

Pop, P.C. (2001)
The generalized minimum spanning tree polytope and related polytopes.
Memorandum 1587, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Pop, P.C. and Kern, W. and Still, G.J. (2001)
An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size.
Memorandum 1577, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

2000

Kern, W. and Paulusma, D. (2000)
Matching games: the least core and the nucleolus.
Memorandum 1541, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Li, X. and Zhang, Shenggui and Broersma, H.J. (2000) Directed paths with few or many colors in colored directed graphs. Memorandum 1543, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

1999

Faigle, U. and Kern, W. and Paulusma, D. (1999)
Note on the computational complexity of least core concepts for min-cost spanning tree games.
Memorandum 1483, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Kern, W. and Paulusma, D. (1999)
The new FIFA rules are hard: Complexity aspects of sports competitions.
Memorandum 1505, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

1998

Faigle, U. and Kern, W. (1998) An algebraic framework for the greedy algorithm with applications to the core and Weber set of cooperative games. Memorandum 1468, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Faigle, U. and Kern, W. and Kuipers, J. (1998)
An efficient algorithm for nucleolus and prekernel computation in some classes of TU-games.
Memorandum 1464, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Hunting, M.M.G. and Faigle, U. and Kern, W. (1998)
A Lagrangian relaxation approach to the edge-weighted clique problem.
Memorandum 1476, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690