Oren Ben-Zwi

CoRR, 2023

2017

Walrasian's characterization and a universal ascending auction.

[BibT_eX]

[DOI]

Games Econ. Behav., 2017

2015

Hats, auctions and derandomization.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2015

Ad Exchange: Envy-Free Auctions with Mediators.

[BibT_eX]

[DOI]

Monika Henzinger

Veronika Loitzenbauer

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

2013

Ascending auctions and Walrasian equilibrium

[BibT_eX]

[DOI]

Ron Lavi

CoRR, 2013

2011

Algorithmic Game Theory and Graphs.

[BibT_eX]

[DOI]

PhD thesis, 2011

Local and global price of anarchy of graphical games.

[BibT_eX]

[DOI]

Amir Ronen

Theor. Comput. Sci., 2011

Applying Property Testing to an Image Partitioning Problem.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 2011

Treewidth governs the complexity of target set selection.

[BibT_eX]

[DOI]

Discret. Optim., 2011

Optimal Bi-Valued Auctions

[BibT_eX]

[DOI]

CoRR, 2011

2010

Combinatorial model and bounds for target set selection.

[BibT_eX]

[DOI]

Eyal Ackerman

Theor. Comput. Sci., 2010

A Hat Trick.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009

On sets of points that determine only acute angles.

[BibT_eX]

[DOI]

Eyal Ackerman

Eur. J. Comb., 2009

An exact almost optimal algorithm for target set selection in social networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

A New Derandomization of Auctions.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

2007

Lower bounds for testing Euclidean Minimum Spanning Trees.

[BibT_eX]

[DOI]

Oded Lachish

Inf. Process. Lett., 2007

2005

Handling Sensed Data in Hostile Environments.

[BibT_eX]

[DOI]