|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4 occurrences of 4 keywords
|
|
|
|
|
Results
Found 34 publication records. Showing 34 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy |
Approximability of the Firefighter Problem - Computing Cuts over Time.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Martin Hoefer |
Contribution Games in Networks. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Onkar Bhardwaj, Martin Hoefer |
Friendship, Altruism, and Reward Sharing in Stable Matching and Contribution Games |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Elliot Anshelevich, Bugra Caskurlu |
Exact and approximate equilibria for optimal group network formation. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong |
Strategic network formation through peering and service agreements. |
Games and Economic Behavior |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Bugra Caskurlu |
Price of Stability in Survivable Network Design. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich |
A competitive strategy for routing flow over time. |
SIGecom Exchanges |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Adriana Karagiozova |
Terminal Backup, 3D Matching, and Covering Cubic Graphs. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich |
A Stackelberg Strategy for Routing Flow over Time. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Elliot Anshelevich, Ameya Hate, Koushik Kar |
Strategic Pricing in Next-Hop Routing with Elastic Demands. |
SAGT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich |
A Stackelberg Strategy for Routing Flow over Time |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Elliot Anshelevich, Martin Hoefer |
Contribution Games in Social Networks |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Elliot Anshelevich, Sanmay Das |
Matching, cardinal utility, and social welfare. |
SIGecom Exchanges |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Martin Hoefer |
Contribution Games in Social Networks. |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Bugra Caskurlu, Ameya Hate |
Partition Equilibrium Always Exists in Resource Selection Games. |
SAGT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Bugra Caskurlu, Ameya Hate |
Strategic Multiway Cut and Multicut Games. |
WAOA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Bugra Caskurlu |
Exact and Approximate Equilibria for Optimal Group Network Formation. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Sanmay Das, Yonatan Naamad |
Anarchy, Stability, and Utopia: Creating Better Matchings. |
SAGT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Bugra Caskurlu |
Price of Stability in Survivable Network Design. |
SAGT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Satish Ukkusuri |
Equilibria in Dynamic Selfish Routing. |
SAGT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy |
Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler |
Near-Optimal Network Design with Selfish Agents. |
Theory of Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Lisa Zhang |
Path decomposition under a new cost measure with applications to optical network design. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
Optical network design, path decomposition, approximation algorithms |
| 1 | Elliot Anshelevich, David Kempe, Jon M. Kleinberg |
Stability of Load Balancing Algorithms in Dynamic Adversarial Systems. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden |
The Price of Stability for Network Design with Fair Cost Allocation. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Gordon T. Wilfong |
Network Formation and Routing by Strategic Agents Using Local Contracts. |
WINE |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dahai Xu, Elliot Anshelevich, Mung Chiang |
On Survivable Access Network Design: Complexity and Algorithms. |
INFOCOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Adriana Karagiozova |
Terminal backup, 3D matching, and covering cubic graphs. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
simplex matching, terminal backup, polynomial time |
| 1 | Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong |
Strategic Network Formation through Peering and Service Agreements. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Lisa Zhang |
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden |
The Price of Stability for Network Design with Fair Cost Allocation. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler |
Near-optimal network design with selfish agents. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
network design, price of anarchy |
| 1 | Elliot Anshelevich, David Kempe, Jon M. Kleinberg |
Stability of load balancing algorithms in dynamic adversarial systems. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Scott Owens, Florent Lamiraux, Lydia E. Kavraki |
Deformable Volumes in Path Planning Applications. |
ICRA |
2000 |
DBLP BibTeX RDF |
|
Displaying result #1 - #34 of 34 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")