Author image not provided
 Max Klimm

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article3.22
Citation Count58
Publication count18
Publication years2009-2017
Available for download5
Average downloads per article59.60
Downloads (cumulative)298
Downloads (12 Months)89
Downloads (6 Weeks)17
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


18 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 18 of 18
Sort by:

1 published by ACM
December 2017 ACM Transactions on Economics and Computation (TEAC) - Special Issue on Wine'15: Volume 5 Issue 4, December 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 7,   Downloads (12 Months): 7,   Downloads (Overall): 7

Full text available: PDFPDF
We study mechanisms that select members of a set of agents based on nominations by other members and that are impartial in the sense that agents cannot influence their own chance of selection. Prior work has shown that deterministic mechanisms for selecting any fixed number k of agents are severely ...
Keywords: Mechanism design, impartial selection

2 published by ACM
July 2017 SPAA '17: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 6,   Downloads (12 Months): 40,   Downloads (Overall): 40

Full text available: PDFPDF
We study general resource allocation problems with a diseconomy of scale. Given a finite set of commodities that request certain resources, the cost of each resource grows superlinearly with the demand for it, and our goal is to minimize the total cost of the resources. In large systems with limited ...
Keywords: congestion games, distributed algorithm, locality gap, approximation algorithm, energy efficiency

3
January 2016 SODA '16: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2,   Downloads (12 Months): 26,   Downloads (Overall): 62

Full text available: PDFPDF
We consider the fundamental problem of exploring an undirected and initially unknown graph by an agent with little memory. The vertices of the graph are unlabeled, and the edges incident to a vertex have locally distinct labels. In this setting, it is known that Θ(log n ) bits of memory ...

4
December 2015 WINE 2015: Proceedings of the 11th International Conference on Web and Internet Economics - Volume 9470
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Bottleneck routing games are a well-studied model to investigate the impact of selfish behavior in communication networks. In this model, each user selects a path in a network for routing their fixed demand. The disutility of a used only depends on the most congested link visited. We extend this model ...

5
December 2015 WINE 2015: Proceedings of the 11th International Conference on Web and Internet Economics - Volume 9470
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We study mechanisms that select members of a set of agents based on nominations by other members and that are impartial in the sense that agents cannot influence their own chance of selection. Prior work has shown that deterministic mechanisms for selecting any fixed number of agents are severely limited, ...

6
May 2015 CIAC 2015: Proceedings of the 9th International Conference on Algorithms and Complexity - Volume 9079
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

In cost sharing games, the existence and efficiency of pure Nash equilibria fundamentally depends on the method that is used to share the resources' costs. We consider a general class of resource allocation problems in which a set of resources is used by a heterogeneous set of selfish users. The ...

7
May 2015 Networks: Volume 65 Issue 3, May 2015
Publisher: Wiley-Interscience
Bibliometrics:
Citation Count: 0

Reducing traffic congestion via toll pricing has been a central topic in the operations research and transportation literature and, recently, it has been implemented in several cities all over the world. Since, in practice, it is not feasible to impose tolls on every edge of a given traffic network, we ...
Keywords: network tolls, support constraints, Wardrop equilibrium, marginal cost pricing

8
January 2015 Theoretical Computer Science: Volume 562 Issue C, January 2015
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 1

In this article we show that the price of stability of Shapley network design games on undirected graphs with k players is at most k 3 ( k + 1 ) / 2 - k 2 1 + k 3 ( k + 1 ) / 2 - k 2 ...
Keywords: Potential-optimal price of stability, Price of stability, Potential-optimal price of anarchy, Undirected Shapley network design game

9 published by ACM
June 2014 EC '14: Proceedings of the fifteenth ACM conference on Economics and computation
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 3,   Downloads (12 Months): 7,   Downloads (Overall): 69

Full text available: PDFPDF
We study the problem of selecting a member of a set of agents based on impartial nominations by agents from that set. The problem was studied previously by Alon et al. and by Holzman and Moulin and has important applications in situations where representatives are selected from within a group ...
Keywords: impartial selection, impartiality, voting

10
August 2012 Mathematics of Operations Research: Volume 37 Issue 3, 08 2012
Publisher: INFORMS
Bibliometrics:
Citation Count: 9

We study the existence of pure Nash equilibria in weighted congestion games. Let C denote a set of cost functions. We say that C is consistent if every weighted congestion game with cost functions in C possesses a pure Nash equilibrium. Our main contribution is a complete characterization of consistency ...
Keywords: pure Nash equilibria, weighted congestion games, cost functions.

11
December 2011 WINE'11: Proceedings of the 7th international conference on Internet and Network Economics
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

In this paper, we introduce a class of games which we term <em>demand allocation games</em> that combines the characteristics of finite games such as congestion games and continuous games such as Cournot oligopolies. In a strategy profile each player may choose both an action out of a finite set and ...

12
December 2011 ISAAC'11: Proceedings of the 22nd international conference on Algorithms and Computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We study the problem of distributing a file initially located at a server among a set of peers. Peers who downloaded the file can upload it to other peers. The server and the peers are connected to each other via a core network. The upload and download rates to and ...

13 published by ACM
July 2011 TARK XIII: Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 1,   Downloads (12 Months): 5,   Downloads (Overall): 112

Full text available: PDFPDF
We initiate the study of congestion games with variable demands where the (variable) demand has to be assigned to exactly one subset of resources. The players' incentives to use higher demands are stimulated by non-decreasing and concave utility functions. The payoff for a player is defined as the difference between ...
Keywords: pure Nash equilibria, congestion games, variable demand

14
July 2011 Theory of Computing Systems - Special Issue: Algorithmic Game Theory: Volume 49 Issue 1, July 2011
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 8

Since the pioneering paper of Rosenthal a lot of work has been done in order to determine classes of games that admit a potential. First, we study the existence of potential functions for weighted congestion games. Let $\mathcal{C}$ be an arbitrary set of locally bounded functions and let $\mathcal{G}(\mathcal{C})$ be ...
Keywords: Pure Nash equilibria, Potential functions

15
September 2010 ESA'10: Proceedings of the 18th annual European conference on Algorithms: Part II
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 6

Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria - a strengthening of Nash equilibrium to resilience against coalitional deviations. In this paper, we study the computational complexity of pure Nash and strong equilibria in these games. We provide ...

16
July 2010 ICALP'10: Proceedings of the 37th international colloquium conference on Automata, languages and programming
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 10

We study the existence of pure Nash equilibria in weighted congestion games. Let C denote a set of cost functions. We say that C is consistent if every weighted congestion game with cost functions in C possesses a pure Nash equilibrium. We say that C is FIP-consistent if every weighted ...

17
December 2009 WINE '09: Proceedings of the 5th International Workshop on Internet and Network Economics
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 11

We provide an axiomatic framework for the the well studied lexicographical improvement property and derive new results on the existence of strong Nash equilibria for a very general class of congestion games with bottleneck objectives. This includes extensions of classical load-based models, routing games with splittable demands, scheduling games with ...

18
October 2009 SAGT '09: Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

Since the pioneering paper of Rosenthal a lot of work has been done in order to determine classes of games that admit a potential. First, we study the existence of potential functions for weighted congestion games. Let $\mathcal{C}$ be an arbitrary set of locally bounded functions and let $\mathcal{G}(\mathcal{C})$ be ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us