Result 1 to 20 of 114 total
On the approximability of Dodgson and Young elections. (English)
Artif. Intell. 187-188, 31-51 (2012).
1
Space lower bounds for low-stretch greedy embeddings. (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, 1-12 (2012).
2
Revenue guarantees in sponsored search auctions. (English)
Epstein, Leah (ed.) et al., Algorithms ‒ ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10‒12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 253-264 (2012).
3
An improved 2-agent kidney exchange mechanism. (English)
Chen, Ning (ed.) et al., Internet and network economics. 7th international workshop, WINE 2011, Singapore, December 11‒14, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25509-0/pbk). Lecture Notes in Computer Science 7090, 37-48 (2011).
4
Voting almost maximizes social welfare despite limited communication. (English)
Artif. Intell. 175, No. 9-10, 1655-1671 (2011).
5
Tight bounds for selfish and greedy load balancing. (English)
Algorithmica 61, No. 3, 606-637 (2011).
6
Enforcing efficient equilibria in network design games via subsidies. (English)
Comput. Res. Repos. 2011, Article No. 1104.4423 (2011).
7
Efficient computation of approximate pure Nash equilibria. (English)
Comput. Res. Repos. 2011, Article No. 1104.2690 (2011).
8
Tight approximation bounds for greedy frugal coverage algorithms. (English)
Atallah, Mikhail (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Joint international conference, FAW-AAIM 2011, Jinhua, China, May 28‒31, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21203-1/pbk). Lecture Notes in Computer Science 6681, 185-195 (2011).
9
Tight approximation bounds for greedy frugal coverage algorithms (English)
FAW-AAIM, 185-195 (2011).
10
Towards more expressive cake cutting (English)
IJCAI, 127-132 (2011).
11
An improved 2-agent kidney exchange mechanism (English)
WINE, 37-48 (2011).
12
On the efficiency of equilibria in generalized second price auctions (English)
ACM Conference on Electronic Commerce, 81-90 (2011).
13
The impact of altruism on the efficiency of atomic congestion games. (English)
Wirsing, Martin (ed.) et al., Trustworthly global computing. 5th international symposium, TGC 2010, Munich, Germany, February 24‒26, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-15639-7/pbk). Lecture Notes in Computer Science 6084, 172-188 (2010).
14
Fractional path coloring in bounded degree trees with applications. (English)
Algorithmica 58, No. 2, 516-540 (2010).
15
Energy consumption minimization in ad hoc wireless and multi-interface networks. (English)
Koster, Arie M. C. A. (ed.) et al., Graphs and algorithms in communication networks. Studies in broadband, optical, wireless and ad hoc networks. Berlin: Springer (ISBN 978-3-642-02249-4/hbk; 978-3-642-02250-0/ebook). Texts in Theoretical Computer Science. An EATCS Series, 335-355 (2010).
16
Game-theoretic approaches to optimization problems in communication networks. (English)
Koster, Arie M. C. A. (ed.) et al., Graphs and algorithms in communication networks. Studies in broadband, optical, wireless and ad hoc networks. Berlin: Springer (ISBN 978-3-642-02249-4/hbk; 978-3-642-02250-0/ebook). Texts in Theoretical Computer Science. An EATCS Series, 241-263 (2010).
17
Taxes for linear atomic congestion games (English)
ACM Transactions on Algorithms 7, No. 1, 13 (2010).
18
Improved lower bounds on the price of stability of undirected network design games (English)
SAGT, 90-101 (2010).
19
Socially desirable approximations for dodgson’s voting rule (English)
ACM Conference on Electronic Commerce, 253-262 (2010).
20
Result 1 to 20 of 114 total
Start
Contact
Print
General Help
