Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Alexander
Last name:	Skopalik
DBLP:	73/36
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 24 of 24  

Select a publication
Show	Title	Venue	Rating	Date
	Conference paper Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik. Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure.	ACM Conference on Electronic Commerce, EC '12, Valencia, Spain, June 4-8, 2012 2012	(0)	2012
	Conference paper Angelo Fanelli, Luca Moscardelli, Alexander Skopalik. On the Impact of Fair Best Response Dynamics.	Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings 2012	(0)	2012
	Journal article Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik. Computing approximate pure Nash equilibria in congestion games.	SIGecom Exchanges 2012, Volume 11	(0)	2012
	Conference paper Martin Hoefer, Alexander Skopalik. Social Context in Potential Games.	Internet and Network Economics - 8th International Workshop, WINE 2012, Liverpool, UK, December 10-12, 2012. Proceedings 2012	(0)	2012
	Journal article Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik. Efficient computation of approximate pure Nash equilibria	CoRR 2011, Volume 0	(0)	2011
	Journal article Angelo Fanelli, Luca Moscardelli, Alexander Skopalik. On the Impact of Fair Best Response Dynamics	CoRR 2011, Volume 0	(0)	2011
	Journal article Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik. Computing approximate pure Nash equilibria in weighted congestion games with polynomial latency functions	CoRR 2011, Volume 0	(0)	2011
	Conference paper Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking. Considerate Equilibrium.	IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011 2011	(0)	2011
	Conference paper Yair Zick, Alexander Skopalik, Edith Elkind. The Shapley Value as a Function of the Quota in Weighted Voting Games.	IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011 2011	(0)	2011
	Conference paper Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik. Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games.	IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011 2011	(0)	2011
	Conference paper Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik. Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games.	Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II 2010	(0)	2010
	Conference paper Martin Hoefer, Alexander Skopalik. On the Complexity of Pareto-optimal Nash and Strong Equilibria.	Algorithmic Game Theory - Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010. Proceedings 2010	(0)	2010
	Journal article Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking. Considerate Equilibrium	CoRR 2010, Volume 0	(0)	2010
	Conference paper Martin Hoefer, Alexander Skopalik. Altruism in Atomic Congestion Games.	Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings 2009	(0)	2009
	Conference paper Vahab S. Mirrokni, Alexander Skopalik. On the complexity of nash dynamics and sink equilibria.	Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), Stanford, California, USA, July 6--10, 2009 2009	(0)	2009
	Conference paper Martin Hoefer, Alexander Skopalik. Stability and Convergence in Selfish Scheduling with Altruistic Agents.	Internet and Network Economics, 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009. Proceedings 2009	(0)	2009
	Conference paper Martin Hoefer, Lars Olbrich, Alexander Skopalik. Doing Good with Spam Is Hard.	Algorithmic Game Theory, Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings 2009	(0)	2009
	Conference paper Vahab S. Mirrokni, Alexander Skopalik. On the complexity of Nash dynamics and Sink Equilibria	CoRR 2009, Volume 0	(0)	2009
	Conference paper Baruch Awerbuch, Yossi Azar, Amir Epstein, Vahab S. Mirrokni, Alexander Skopalik. Fast convergence to nearly optimal solutions in potential games.	Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), Chicago, IL, USA, June 8-12, 2008 2008	(0)	2008
	Conference paper Alexander Skopalik, Berthold Vöcking. Inapproximability of pure nash equilibria.	Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008 2008	(0)	2008
	Conference paper Martin Hoefer, Lars Olbrich, Alexander Skopalik. Taxing Subnetworks.	Internet and Network Economics, 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings 2008	(0)	2008
	Conference paper Martin Hoefer, Alexander Skopalik. Altruism in Congestion Games	CoRR 2008, Volume 0	(0)	2008
	Journal article Heiner Ackermann, Alexander Skopalik. Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games.	Internet Mathematics 2008, Volume 5	(0)	2008
	Conference paper Heiner Ackermann, Alexander Skopalik. On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games.	Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings 2007	(0)	2007

Show item 1 to 24 of 24  

Your query returned 24 matches in the database.