1.4k citations
- D. Schaile11 profiles116 · h 87
- A. Quadt12 profiles112 · h 86
- A. Harel12 profiles111 · h 107
- F. Fiedler4 profiles111 · h 87
- G. Wilson5 profiles111 · h 62
- P. Renkel11 profiles111 · h 51
- A. Meyer4 profiles110 · h 142
- G. Davies6 profiles110 · h 107
- M. Verzocchi16 profiles110 · h 86
- S. Banerjee5 profiles110 · h 90
- A. Garcia-Bellido3 profiles109 · h 115
- F. Badaud2 profiles109 · h 57
- University of WuppertalDE122 papers
- Johannes Gutenberg University MainzDE120 papers
- Ludwig-Maximilians-Universität MünchenDE118 papers
- University of KansasUS118 papers
- University of Maryland, College ParkUS117 papers
- University of FreiburgDE116 papers
- Fermi National Accelerator LaboratoryUS115 papers
- Imperial College LondonGB114 papers
- Lyon 1 UniversitéFR114 papers
- University of California, RiversideUS113 papers
- University of ManchesterGB113 papers
- Brookhaven National LaboratoryUS111 papers
4 papers · 2 filters
Considerate Equilibrium
Martin Hoefer, Michal Penn, Maria Polukarov +2
We consider the existence and computational complexity of coalitional stability concepts based on social networks. Our concepts represent a natural and rich combinatorial generaliz…
Formats of Winning Strategies for Six Types of Pushdown Games
Wladimir Fridman
The solution of parity games over pushdown graphs (Walukiewicz '96) was the first step towards an effective theory of infinite-state games. It was shown that winning strategies for…
Playing Muller Games in a Hurry
John Fearnley, Martin Zimmermann
This work studies the following question: can plays in a Muller game be stopped after a finite number of moves and a winner be declared. A criterion to do this is sound if Player 0…
Strategic Cooperation in Cost Sharing Games
Martin Hoefer
In this paper we consider strategic cost sharing games with so-called arbitrary sharing based on various combinatorial optimization problems, such as vertex and set cover, facility…