default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiad Blumrosen
Person information
- affiliation: Hebrew University, Hebrew University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Liad Blumrosen, Shahar Dobzinski:
Combinatorial Reallocation Mechanisms. Algorithmica 86(4): 1246-1262 (2024)- 2023
- [j11]Liad Blumrosen, Yehonatan Mizrahi:
How bad is the merger paradox? Theor. Comput. Sci. 978: 114157 (2023) - 2022
- [c20]Liad Blumrosen, Yehonatan Mizrahi:
How Bad is the Merger Paradox? SAGT 2022: 23-40 - 2021
- [j10]Liad Blumrosen, Shahar Dobzinski:
(Almost) efficient mechanisms for bilateral trading. Games Econ. Behav. 130: 369-383 (2021)
2010 – 2019
- 2017
- [j9]Moshe Babaioff, Liad Blumrosen, Shaddin Dughmi, Yaron Singer:
Posting Prices with Unknown Distributions. ACM Trans. Economics and Comput. 5(2): 13:1-13:20 (2017) - [c19]Moshe Babaioff, Liad Blumrosen, Noam Nisan:
Selling Complementary Goods: Dynamics, Efficiency and Revenue. ICALP 2017: 134:1-134:14 - [i6]Moshe Babaioff, Liad Blumrosen, Noam Nisan:
Selling Complementary Goods: Dynamics, Efficiency and Revenue. CoRR abs/1706.00219 (2017) - 2016
- [c18]Moshe Babaioff, Liad Blumrosen, Noam Nisan:
Networks of Complements. ICALP 2016: 140:1-140:14 - [c17]Liad Blumrosen, Yehonatan Mizrahi:
Approximating Gains-from-Trade in Bilateral Trading. WINE 2016: 400-413 - [i5]Liad Blumrosen, Shahar Dobzinski:
(Almost) Efficient Mechanisms for Bilateral Trading. CoRR abs/1604.04876 (2016) - [i4]Moshe Babaioff, Liad Blumrosen, Noam Nisan:
Networks of Complements. CoRR abs/1605.00136 (2016) - 2015
- [j8]Moshe Babaioff, Liad Blumrosen, Aaron Roth
:
Auctions with online supply. Games Econ. Behav. 90: 227-246 (2015) - [c16]Liad Blumrosen, Osnat Zohar:
Multilateral Deferred-Acceptance Mechanisms. WINE 2015: 173-186 - 2014
- [c15]Liad Blumrosen, Shahar Dobzinski:
Reallocation mechanisms. EC 2014: 617 - [i3]Liad Blumrosen, Shahar Dobzinski:
Reallocation Mechanisms. CoRR abs/1404.6786 (2014) - 2013
- [j7]Moshe Babaioff, Liad Blumrosen, Michael Schapira:
The communication burden of payment determination. Games Econ. Behav. 77(1): 153-167 (2013) - [j6]Liad Blumrosen, Michal Feldman:
Mechanism design with a restricted action space. Games Econ. Behav. 82: 424-443 (2013) - 2011
- [c14]Moshe Babaioff, Liad Blumrosen, Shaddin Dughmi, Yaron Singer:
Posting Prices with Unknown Distributions. ICS 2011: 166-178 - [c13]Moshe Babaioff, Liad Blumrosen, Nicolas S. Lambert, Omer Reingold:
Only valuable experts can be valued. EC 2011: 221-222 - [i2]Liad Blumrosen, Noam Nisan, Ilya Segal:
Auctions with Severely Bounded Communication. CoRR abs/1110.2733 (2011) - 2010
- [j5]Liad Blumrosen, Noam Nisan:
Informational limitations of ascending combinatorial auctions. J. Econ. Theory 145(3): 1203-1223 (2010) - [c12]Moshe Babaioff, Liad Blumrosen, Aaron Roth:
Auctions with online supply. EC 2010: 13-22
2000 – 2009
- 2009
- [j4]Liad Blumrosen, Noam Nisan:
On the Computational Power of Demand Queries. SIAM J. Comput. 39(4): 1372-1391 (2009) - [i1]Moshe Babaioff, Liad Blumrosen, Aaron Roth:
Auctions with Online Supply. CoRR abs/0905.3429 (2009) - 2008
- [j3]Moshe Babaioff, Liad Blumrosen:
Computationally-feasible truthful auctions for convex bundles. Games Econ. Behav. 63(2): 588-620 (2008) - [c11]Liad Blumrosen, Thomas Holenstein:
Posted prices vs. negotiations: an asymptotic analysis. EC 2008: 49 - [c10]Moshe Babaioff, Liad Blumrosen, Moni Naor, Michael Schapira:
Informational overhead of incentive compatibility. EC 2008: 88-97 - 2007
- [j2]Liad Blumrosen, Noam Nisan, Ilya Segal:
Auctions with Severely Bounded Communication. J. Artif. Intell. Res. 28: 233-266 (2007) - [j1]Liad Blumrosen, Shahar Dobzinski:
Welfare Maximization in Congestion Games. IEEE J. Sel. Areas Commun. 25(6): 1224-1236 (2007) - [c9]Liad Blumrosen:
Implementing the Maximum of Monotone Algorithms. AAAI 2007: 30-35 - [c8]Liad Blumrosen:
Implementing the maximum of monotone algorithms. AAMAS 2007: 82 - 2006
- [b1]Liad Blumrosen:
Information and communication in mechanism design (אינפורמציה ותקשורת בתכנון מנגנונים.). Hebrew University of Jerusalem, Israel, 2006 - [c7]Liad Blumrosen, Shahar Dobzinski:
Welfare maximization in congestion games. EC 2006: 52-61 - [c6]Liad Blumrosen, Michal Feldman:
Implementation with a bounded action space. EC 2006: 62-71 - 2005
- [c5]Liad Blumrosen, Noam Nisan:
On the computational power of iterative auctions. EC 2005: 29-43 - 2004
- [c4]Moshe Babaioff, Liad Blumrosen:
Computationally-Feasible Truthful Auctions for Convex Bundles. APPROX-RANDOM 2004: 27-38 - 2003
- [c3]Liad Blumrosen, Noam Nisan, Ilya Segal:
Multi-player and Multi-round Auctions with Severely Bounded Communication. ESA 2003: 102-113 - 2002
- [c2]Liad Blumrosen, Noam Nisan:
Auctions with Severely Bounded Communication. FOCS 2002: 406-415 - 2001
- [c1]Lior Levy, Liad Blumrosen, Noam Nisan:
On-Line Markets for Distributed Object Services: The MAJIC System. USITS 2001: 85-96
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-04-24 23:03 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:
