default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInbal Talgam-Cohen
Person information
- affiliation: Technion - Israel Institute of Technology
SPARQL queries 
🛈 Please note that only 71% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j27]Tal Alon
, Inbal Talgam-Cohen, Ron Lavi, Elisheva S. Shamash:
Technical Note - Incomplete Information VCG Contracts for Common Agency. Oper. Res. 72(1): 288-299 (2024)- [i38]Guru Guruganesh, Yoav Kolumbus, Jon Schneider, Inbal Talgam-Cohen, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Joshua R. Wang, S. Matthew Weinberg:
Contracting with a Learning Agent. CoRR abs/2401.16198 (2024) - [i37]Zohar Barak, Anupam Gupta, Inbal Talgam-Cohen:
MAC Advice for Facility Location Mechanism Design. CoRR abs/2403.12181 (2024) - [i36]Roy Maor Lotan, Inbal Talgam-Cohen, Yaniv Romano:
Strategy-Proof Auctions through Conformal Prediction. CoRR abs/2405.12016 (2024) - [i35]Eden Saig, Ohad Einav, Inbal Talgam-Cohen:
Incentivizing Quality Text Generation via Statistical Contracts. CoRR abs/2406.11118 (2024) - [i34]Dima Ivanov, Paul Dütting, Inbal Talgam-Cohen, Tonghan Wang, David C. Parkes:
Principal-Agent Reinforcement Learning. CoRR abs/2407.18074 (2024) - 2023
- [c38]Tonghan Wang, Paul Duetting, Dmitry Ivanov, Inbal Talgam-Cohen, David C. Parkes:
Deep Contract Design via Discontinuous Networks. NeurIPS 2023 - [c37]Eden Saig, Inbal Talgam-Cohen, Nir Rosenfeld:
Delegated Classification. NeurIPS 2023 - [c36]Tal Alon, Paul Duetting, Yingkai Li, Inbal Talgam-Cohen:
Bayesian Analysis of Linear Contracts. EC 2023: 66 - [c35]Itai Arieli, Yakov Babichenko, Inbal Talgam-Cohen, Konstantin Zabarnyi:
Universally Robust Information Aggregation for Binary Decisions. EC 2023: 118 - [c34]Avi Cohen, Michal Feldman, Divyarthi Mohan, Inbal Talgam-Cohen:
Interdependent Public Projects. SODA 2023: 416-443 - [i33]Itai Arieli, Yakov Babichenko, Inbal Talgam-Cohen, Konstantin Zabarnyi:
Universally Robust Information Aggregation for Binary Decisions. CoRR abs/2302.03667 (2023) - [i32]Eden Saig, Inbal Talgam-Cohen, Nir Rosenfeld:
Delegated Classification. CoRR abs/2306.11475 (2023) - [i31]Tonghan Wang, Paul Dütting, Dmitry Ivanov, Inbal Talgam-Cohen, David C. Parkes:
Deep Contract Design via Discontinuous Piecewise Affine Neural Networks. CoRR abs/2307.02318 (2023) - [i30]Yakov Babichenko, Inbal Talgam-Cohen, Haifeng Xu, Konstantin Zabarnyi:
Algorithmic Cheap Talk. CoRR abs/2311.09011 (2023) - 2022
- [j26]Yakov Babichenko, Inbal Talgam-Cohen, Haifeng Xu, Konstantin Zabarnyi:
Regret-minimizing Bayesian persuasion. Games Econ. Behav. 136: 226-248 (2022) - [c33]Vineet Nair, Ganesh Ghalme, Inbal Talgam-Cohen, Nir Rosenfeld:
Strategic Representation. ICML 2022: 16331-16352 - [c32]Yakov Babichenko, Inbal Talgam-Cohen, Haifeng Xu, Konstantin Zabarnyi:
Multi-Channel Bayesian Persuasion. ITCS 2022: 11:1-11:2 - [c31]Nir Bachrach, Inbal Talgam-Cohen:
Distributional Robustness: From Pricing to Auctions. EC 2022: 150 - [e1]Michal Feldman, Hu Fu, Inbal Talgam-Cohen:
Web and Internet Economics - 17th International Conference, WINE 2021, Potsdam, Germany, December 14-17, 2021, Proceedings. Lecture Notes in Computer Science 13112, Springer 2022, ISBN 978-3-030-94675-3 [contents] - [i29]Avi Cohen, Michal Feldman, Divyarthi Mohan, Inbal Talgam-Cohen:
Interdependent Public Projects. CoRR abs/2204.08044 (2022) - [i28]Nir Bachrach, Inbal Talgam-Cohen:
Distributional Robustness: From Pricing to Auctions. CoRR abs/2205.09008 (2022) - [i27]Vineet Nair, Ganesh Ghalme, Inbal Talgam-Cohen, Nir Rosenfeld:
Strategic Representation. CoRR abs/2206.08542 (2022) - [i26]Yakov Babichenko, Inbal Talgam-Cohen, Haifeng Xu, Konstantin Zabarnyi:
Information Design in the Principal-Agent Problem. CoRR abs/2209.13688 (2022) - [i25]Tal Alon, Paul Dütting, Yingkai Li, Inbal Talgam-Cohen:
Bayesian Analysis of Linear Contracts. CoRR abs/2211.06850 (2022) - 2021
- [j25]Alon Eden, Michal Feldman, Ophir Friedler, Inbal Talgam-Cohen, S. Matthew Weinberg:
A Simple and Approximately Optimal Mechanism for a Buyer with Complements. Oper. Res. 69(1): 188-206 (2021) - [j24]Moshe Babaioff, Noam Nisan, Inbal Talgam-Cohen:
Competitive Equilibrium with Indivisible Goods and Generic Budgets. Math. Oper. Res. 46(1): 382-403 (2021) - [j23]Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen:
The Complexity of Contracts. SIAM J. Comput. 50(1): 211-254 (2021) - [j22]Inbal Talgam-Cohen, S. Matthew Weinberg:
Editors' introduction. SIGecom Exch. 19(2): 1 (2021) - [c30]Yakov Babichenko, Inbal Talgam-Cohen, Konstantin Zabarnyi:
Bayesian Persuasion under Ex Ante and Ex Post Constraints. AAAI 2021: 5127-5134 - [c29]Alon Eden, Michal Feldman, Inbal Talgam-Cohen, Ori Zviran:
PoA of Simple Auctions with Interdependent Values. AAAI 2021: 5321-5329 - [c28]Ganesh Ghalme, Vineet Nair, Itay Eilat, Inbal Talgam-Cohen, Nir Rosenfeld:
Strategic Classification in the Dark. ICML 2021: 3672-3681 - [c27]Ameer Amer, Inbal Talgam-Cohen:
Auctions with Interdependence and SOS: Improved Approximation. SAGT 2021: 34-48 - [c26]Tal Alon, Paul Dütting, Inbal Talgam-Cohen:
Contracts with Private Cost per Unit-of-Effort. EC 2021: 52-69 - [c25]Tal Alon, Ron Lavi, Elisheva S. Shamash, Inbal Talgam-Cohen:
Incomplete Information VCG Contracts for Common Agency. EC 2021: 70 - [c24]Yakov Babichenko, Inbal Talgam-Cohen, Haifeng Xu, Konstantin Zabarnyi:
Regret-Minimizing Bayesian Persuasion. EC 2021: 128 - [i24]Ganesh Ghalme, Vineet Nair, Itay Eilat, Inbal Talgam-Cohen, Nir Rosenfeld:
Strategic Classification in the Dark. CoRR abs/2102.11592 (2021) - [i23]Yakov Babichenko, Inbal Talgam-Cohen, Haifeng Xu, Konstantin Zabarnyi:
Regret-Minimizing Bayesian Persuasion. CoRR abs/2105.13870 (2021) - [i22]Tal Alon, Ron Lavi, Elisheva S. Shamash, Inbal Talgam-Cohen:
Incomplete Information VCG Contracts for Common Agency. CoRR abs/2105.14998 (2021) - [i21]Ameer Amer, Inbal Talgam-Cohen:
Auctions with Interdependence and SOS: Improved Approximation. CoRR abs/2107.08806 (2021) - [i20]Yotam Gafni, Xin Huang, Ron Lavi, Inbal Talgam-Cohen:
Unified Fair Allocation of Goods and Chores via Copies. CoRR abs/2109.08671 (2021) - [i19]Tal Alon, Paul Dütting, Inbal Talgam-Cohen:
Contracts with Private Cost per Unit-of-Effort. CoRR abs/2111.09179 (2021) - [i18]Yakov Babichenko, Inbal Talgam-Cohen, Haifeng Xu, Konstantin Zabarnyi:
Multi-Channel Bayesian Persuasion. CoRR abs/2111.09789 (2021) - 2020
- [j21]Tim Roughgarden, Inbal Talgam-Cohen, Qiqi Yan:
Robust Auctions for Revenue via Enhanced Competition. Oper. Res. 68(4): 1074-1094 (2020) - [j20]Uriel Feige, Michal Feldman, Inbal Talgam-Cohen:
Approximate Modularity Revisited. SIAM J. Comput. 49(1): 67-97 (2020) - [j19]Inbal Talgam-Cohen, S. Matthew Weinberg:
Editors' introduction. SIGecom Exch. 18(1): 1 (2020) - [j18]Inbal Talgam-Cohen, S. Matthew Weinberg:
Editors' introduction. SIGecom Exch. 18(2): 1 (2020) - [c23]Tal Alon, Magdalen Dobson, Ariel D. Procaccia, Inbal Talgam-Cohen, Jamie Tucker-Foltz:
Multiagent Evaluation Mechanisms. AAAI 2020: 1774-1781 - [c22]Moshe Babaioff, Michal Feldman, Yannai A. Gonczarowski, Brendan Lucier, Inbal Talgam-Cohen:
Escaping Cannibalization? Correlation-Robust Pricing for a Unit-Demand Buyer. EC 2020: 191 - [c21]Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen:
The Complexity of Contracts. SODA 2020: 2688-2707 - [p1]Inbal Talgam-Cohen:
Prior-Independent Auctions. Beyond the Worst-Case Analysis of Algorithms 2020: 586-605 - [i17]Paul Duetting, Tim Roughgarden, Inbal Talgam-Cohen:
The Complexity of Contracts. CoRR abs/2002.12034 (2020) - [i16]Moshe Babaioff, Michal Feldman, Yannai A. Gonczarowski, Brendan Lucier, Inbal Talgam-Cohen:
Escaping Cannibalization? Correlation-Robust Pricing for a Unit-Demand Buyer. CoRR abs/2003.05913 (2020) - [i15]Alon Eden, Michal Feldman, Inbal Talgam-Cohen, Ori Zviran:
Price of Anarchy of Simple Auctions with Interdependent Values. CoRR abs/2011.00498 (2020) - [i14]Yakov Babichenko, Inbal Talgam-Cohen, Konstantin Zabarnyi:
Bayesian Persuasion under Ex Ante and Ex Post Constraints. CoRR abs/2012.03272 (2020)
2010 – 2019
- 2019
- [c20]Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen:
Simple versus Optimal Contracts. EC 2019: 369-387 - [c19]Moshe Babaioff, Noam Nisan, Inbal Talgam-Cohen:
Fair Allocation through Competitive Equilibrium from Generic Incomes. FAT 2019: 180 - [c18]Tomer Ezra, Michal Feldman, Eric Neyman, Inbal Talgam-Cohen, S. Matthew Weinberg:
Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers. FOCS 2019: 249-272 - [i13]Moshe Babaioff, Noam Nisan, Inbal Talgam-Cohen:
Competitive Equilibrium with Generic Budgets: Beyond Additive. CoRR abs/1911.09992 (2019) - 2018
- [i12]Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen:
Simple versus Optimal Contracts. CoRR abs/1808.03713 (2018) - [i11]Tomer Ezra, Michal Feldman, Eric Neyman, Inbal Talgam-Cohen, S. Matthew Weinberg:
Complement-Free Couples Must Communicate: A Hardness Result for Two-Player Combinatorial Auctions. CoRR abs/1811.09871 (2018) - [i10]Tim Roughgarden, Inbal Talgam-Cohen:
Approximately Optimal Mechanism Design. CoRR abs/1812.11896 (2018) - 2017
- [j17]Paul Dütting, Inbal Talgam-Cohen, Tim Roughgarden:
Modularity and greed in double auctions. Games Econ. Behav. 105: 59-83 (2017) - [c17]Tim Roughgarden, Inbal Talgam-Cohen, Jan Vondrák:
When Are Welfare Guarantees Robust?. APPROX-RANDOM 2017: 22:1-22:23 - [c16]Alon Eden, Michal Feldman, Ophir Friedler, Inbal Talgam-Cohen, S. Matthew Weinberg:
A Simple and Approximately Optimal Mechanism for a Buyer with Complements: Abstract. EC 2017: 323 - [c15]Alon Eden, Michal Feldman, Ophir Friedler, Inbal Talgam-Cohen, S. Matthew Weinberg:
The Competition Complexity of Auctions: A Bulow-Klemperer Result for Multi-Dimensional Bidders. EC 2017: 343 - [c14]Tim Roughgarden, Inbal Talgam-Cohen:
Why prices need algorithms (invited talk). STOC 2017: 2 - [c13]Uriel Feige, Michal Feldman, Inbal Talgam-Cohen:
Approximate modularity revisited. STOC 2017: 1028-1041 - [i9]Moshe Babaioff, Noam Nisan, Inbal Talgam-Cohen:
Competitive Equilibria with Indivisible Goods and Generic Budgets. CoRR abs/1703.08150 (2017) - 2016
- [j16]Mukund Sundararajan, Inbal Talgam-Cohen:
Prediction and Welfare in Ad Auctions. Theory Comput. Syst. 59(4): 664-682 (2016) - [j15]Tim Roughgarden, Inbal Talgam-Cohen:
Optimal and Robust Mechanism Design with Interdependent Values. ACM Trans. Economics and Comput. 4(3): 18:1-18:34 (2016) - [c12]Uriel Feige, Michal Feldman, Inbal Talgam-Cohen:
Oblivious Rounding and the Integrality Gap. APPROX-RANDOM 2016: 8:1-8:23 - [c11]Tim Roughgarden, Inbal Talgam-Cohen:
Why Prices Need Algorithms. IJCAI 2016: 4210-4212 - [i8]Tim Roughgarden, Inbal Talgam-Cohen, Jan Vondrák:
When Are Welfare Guarantees Robust? CoRR abs/1608.02402 (2016) - [i7]Uriel Feige, Michal Feldman, Inbal Talgam-Cohen:
Approximate Modularity Revisited. CoRR abs/1612.02034 (2016) - [i6]Alon Eden, Michal Feldman, Ophir Friedler, Inbal Talgam-Cohen, S. Matthew Weinberg:
A Simple and Approximately Optimal Mechanism for a Buyer with Complements. CoRR abs/1612.04746 (2016) - [i5]Alon Eden, Michal Feldman, Ophir Friedler, Inbal Talgam-Cohen, S. Matthew Weinberg:
The Competition Complexity of Auctions: A Bulow-Klemperer Result for Multi-Dimensional Bidders. CoRR abs/1612.08821 (2016) - 2015
- [b1]Inbal Talgam-Cohen:
Robust market design: information and computation. Stanford University, USA, 2015 - [j14]Inbal Talgam-Cohen:
Crossing boundaries. XRDS 21(4): 5-7 (2015) - [j13]Tim Roughgarden, Inbal Talgam-Cohen:
Why prices need algorithms. SIGecom Exch. 14(2): 35-40 (2015) - [c10]Tim Roughgarden, Inbal Talgam-Cohen:
Why Prices Need Algorithms. EC 2015: 19-36 - [c9]Shahar Dobzinski, Michal Feldman, Inbal Talgam-Cohen, Omri Weinstein:
Welfare and Revenue Guarantees for Competitive Bundling Equilibrium. WINE 2015: 300-313 - 2014
- [j12]Inbal Talgam-Cohen:
Enriching your network via diversity. XRDS 20(3): 5-6 (2014) - [j11]Sean Follmer, Inbal Talgam-Cohen:
Towards a critical debate about technology and its impact. XRDS 20(4): 5-7 (2014) - [j10]Inbal Talgam-Cohen, Sean Follmer:
Do no evil in research. XRDS 21(1): 5-6 (2014) - [j9]Sean Follmer, Inbal Talgam-Cohen:
A shrimp's tale: why we need to fund research. XRDS 21(2): 5-6 (2014) - [j8]Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar:
Vertex Sparsifiers: New Results from Old Techniques. SIAM J. Comput. 43(4): 1239-1262 (2014) - [c8]Mukund Sundararajan, Inbal Talgam-Cohen:
Prediction and Welfare in Ad Auctions. SAGT 2014: 267-278 - [c7]Paul Dütting, Tim Roughgarden, Inbal Talgam-Cohen:
Modularity and greed in double auctions. EC 2014: 241-258 - [i4]Shahar Dobzinski, Michal Feldman, Inbal Talgam-Cohen, Omri Weinstein:
Welfare and Revenue Guarantees for Competitive Bundling Equilibrium. CoRR abs/1406.0576 (2014) - 2013
- [j7]Peter Kinnaird, Inbal Talgam-Cohen:
'Information wants to be free'. XRDS 19(3): 4-5 (2013) - [j6]Inbal Talgam-Cohen, Peter Kinnaird:
Money and power in academic publishing. XRDS 19(4): 5-6 (2013) - [j5]Peter Kinnaird, Inbal Talgam-Cohen:
Equip Yourself for Creativity. XRDS 20(1): 5-7 (2013) - [c6]Tim Roughgarden, Inbal Talgam-Cohen:
Optimal and near-optimal mechanism design with interdependent values. EC 2013: 767-784 - [i3]Mukund Sundararajan, Inbal Talgam-Cohen:
Refine Predictions Ad Infinitum? CoRR abs/1302.6700 (2013) - 2012
- [j4]Peter Kinnaird, Inbal Talgam-Cohen:
XRDS reloaded. XRDS 18(4): 3 (2012) - [j3]Peter Kinnaird, Inbal Talgam-Cohen:
Announcing the XRDS blog. XRDS 19(1): 5 (2012) - [j2]Peter Kinnaird, Inbal Talgam-Cohen:
Are you a good match for XRDS?. XRDS 19(2): 5 (2012) - [c5]Hu Fu, Patrick R. Jordan, Mohammad Mahdian, Uri Nadav, Inbal Talgam-Cohen, Sergei Vassilvitskii:
Ad auctions with data. INFOCOM Workshops 2012: 184-189 - [c4]Hu Fu, Patrick R. Jordan, Mohammad Mahdian, Uri Nadav, Inbal Talgam-Cohen, Sergei Vassilvitskii:
Ad Auctions with Data. SAGT 2012: 168-179 - [c3]Tim Roughgarden, Inbal Talgam-Cohen, Qiqi Yan:
Supply-limiting mechanisms. EC 2012: 844-861 - 2010
- [j1]Michael S. Bernstein, Inbal Talgam-Cohen:
Human computation and crowdsourcing. XRDS 17(2): 6 (2010) - [c2]Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar:
Vertex Sparsifiers: New Results from Old Techniques. APPROX-RANDOM 2010: 152-165 - [c1]Uriel Feige, Inbal Talgam-Cohen:
A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium. SAGT 2010: 138-149 - [i2]Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar:
Vertex Sparsifiers: New Results from Old Techniques. CoRR abs/1006.4586 (2010) - [i1]Uriel Feige, Inbal Talgam-Cohen:
A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium. CoRR abs/1007.3886 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 19:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
