I agree that this site is using cookies. You can find further informations here.
X
Blum, Avrim
204  results:
Search for persons X
?
1

Fundamental Bounds on Online Strategic Classification:

, In: Proceedings of the 24th ACM Conference on Economics and Computation,
Ahmadi, Saba ; Blum, Avrim ; Yang, Kunhe - p. 22-58 , 2023
Link: https://dl.acm.org/doi/1..
 
?
2

Multi Stage Screening: Enforcing Fairness and Maximizing Ef..:

, In: 2022 ACM Conference on Fairness, Accountability, and Transparency,
Blum, Avrim ; Stangl, Kevin ; Vakilian, Ali - p. 1178-1193 , 2022
Link: https://dl.acm.org/doi/1..
 
?
3

Incentive-Compatible Kidney Exchange in a Slightly Semi-Ran..:

, In: Proceedings of the 22nd ACM Conference on Economics and Computation,
Blum, Avrim ; Gölz, Paul - p. 138-156 , 2021
Link: https://dl.acm.org/doi/1..
 
?
4

The Strategic Perceptron:

, In: Proceedings of the 22nd ACM Conference on Economics and Computation,
Ahmadi, Saba ; Beyhaghi, Hedyeh ; Blum, Avrim. - p. 6-25 , 2021
Link: https://dl.acm.org/doi/1..
 
?
5

Lifelong learning in costly feature spaces:

Balcan, Maria-Florina ; Blum, Avrim ; Nagarajan, Vaishnavh
Theoretical Computer Science.  808 (2020)  - p. 14-37 , 2020
Link: https://doi.org/10.1016/..
 
?
6

Technical perspective: Algorithm selection as a learning pr..:

Blum, Avrim
Communications of the ACM.  63 (2020)  6 - p. 86-86 , 2020
Link: https://doi.org/10.1145/..
 
?
7

Technical perspective: Algorithm selection as a learning pr..:

Blum, Avrim
Communications of the ACM.  63 (2020)  6 - p. 86 ff. , 2020
Link: https://dl.acm.org/doi/1..
 
?
8

Sparse Approximation via Generating Point Sets:

Blum, Avrim ; Har-Peled, Sariel ; Raichel, Benjamin
ACM Transactions on Algorithms (TALG).  15 (2019)  3 - p. 1-16 , 2019
Link: https://dl.acm.org/doi/1..
 
?
9

Optimal Strategies of Blotto Games : Beyond Convexity:

, In: Proceedings of the 2019 ACM Conference on Economics and Computation,
Behnezhad, Soheil ; Blum, Avrim ; Derakhshan, Mahsa... - p. 597-616 , 2019
Link: https://dl.acm.org/doi/1..
 
?
10

Sparse Approximation via Generating Point Sets:

Blum, Avrim ; Har-Peled, Sariel ; Raichel, Benjamin
ACM Transactions on Algorithms.  15 (2019)  3 - p. 1-16 , 2019
Link: https://doi.org/10.1145/..
 
?
11

Computing Stackelberg Equilibria of Large General-Sum Games:

, In: Algorithmic Game Theory; Lecture Notes in Computer Science,
Blum, Avrim ; Haghtalab, Nika ; Hajiaghayi, MohammadTaghi. - p. 168-182 , 2019
Link: https://doi.org/10.1007/..
 
?
12

From battlefields to elections : winning strategies of b..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Behnezhad, Soheil ; Blum, Avrim ; Derakhshan, Mahsa... - p. 2291-2310 , 2018
Link: https://dl.acm.org/doi/1..
 
?
13

Diversified Strategies for Mitigating Adversarial Attacks i..:

, In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems,
Balcan, Maria-Florina ; Blum, Avrim ; Chen, Shang-Tse - p. 407-415 , 2018
Link: https://dl.acm.org/doi/1..
 
?
14

Learning What's Going on : Reconstructing Preferences an..:

Blum, Avrim ; Mansour, Yishay ; Morgenstern, Jamie
ACM Transactions on Economics and Computation (TEAC).  6 (2018)  3-4 - p. 1-20 , 2018
Link: https://dl.acm.org/doi/1..
 
?
15

From Battlefields to Elections: Winning Strategies of Blott..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Behnezhad, Soheil ; Blum, Avrim ; Derakhshan, Mahsa... - p. 2291-2310 , 2018
Link: https://doi.org/10.1137/..
 
1-15