default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergiu Hart
Person information
- affiliation: Hebrew University, Jerusalem, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Sara Fish, Yannai A. Gonczarowski, Sergiu Hart:
Stable Menus of Public Goods: A Matching Problem. CoRR abs/2402.11370 (2024)- 2022
- [i10]Dean P. Foster, Sergiu Hart:
"Calibeating": Beating Forecasters at Their Own Game. CoRR abs/2209.04892 (2022) - [i9]Sergiu Hart:
Calibrated Forecasts: The Minimax Proof. CoRR abs/2209.05863 (2022) - [i8]Dean P. Foster, Sergiu Hart:
Smooth Calibration, Leaky Forecasts, Finite Recall, and Nash Dynamics. CoRR abs/2210.07152 (2022) - [i7]Dean P. Foster, Sergiu Hart:
Forecast Hedging and Calibration. CoRR abs/2210.07169 (2022) - [i6]Ran Ben Moshe, Sergiu Hart, Noam Nisan:
Monotonic Mechanisms for Selling Multiple Goods. CoRR abs/2210.17150 (2022) - 2020
- [j31]Sergiu Hart, Philip J. Reny:
The Better Half of Selling Separately. ACM Trans. Economics and Comput. 7(4): 18:1-18:18 (2020)
2010 – 2019
- 2019
- [j30]Sergiu Hart
, Noam Nisan:
Selling multiple correlated goods: Revenue maximization and menu-size complexity. J. Econ. Theory 183: 991-1029 (2019) - 2018
- [j29]Sergiu Hart, Noam Nisan:
The query complexity of correlated equilibria. Games Econ. Behav. 108: 401-410 (2018) - [j28]Dean P. Foster, Sergiu Hart:
Smooth calibration, leaky forecasts, finite recall, and Nash dynamics. Games Econ. Behav. 109: 271-293 (2018) - 2017
- [j27]Sergiu Hart, Noam Nisan:
Approximate revenue maximization with multiple items. J. Econ. Theory 172: 313-347 (2017) - [i5]Sergiu Hart, Philip J. Reny:
The Better Half of Selling Separately. CoRR abs/1712.08973 (2017) - 2016
- [j26]Sergiu Hart:
Allocation games with caps: from Captain Lotto to all-pay auctions. Int. J. Game Theory 45(1-2): 37-61 (2016) - 2015
- [j25]Sergiu Hart, Andreu Mas-Colell:
Markets, correlation, and regret-matching. Games Econ. Behav. 93: 42-58 (2015) - 2013
- [c10]Sergiu Hart, Noam Nisan:
The menu-size complexity of auctions. EC 2013: 565-566 - [i4]Sergiu Hart, Noam Nisan:
The Menu-Size Complexity of Auctions. CoRR abs/1304.6116 (2013) - [i3]Sergiu Hart, Noam Nisan:
The Query Complexity of Correlated Equilibria. CoRR abs/1305.4874 (2013) - [i2]Sergiu Hart, Éva Tardos, Bernhard von Stengel:
Interface of Computation, Game Theory, and Economics (Dagstuhl Seminar 13161). Dagstuhl Reports 3(4): 69-90 (2013) - 2012
- [c9]Sergiu Hart, Noam Nisan:
Approximate revenue maximization with multiple items. EC 2012: 656 - [i1]Sergiu Hart, Noam Nisan:
Approximate Revenue Maximization with Multiple Items. CoRR abs/1204.1846 (2012) - 2011
- [j24]Sergiu Hart:
Commentary: Nash equilibrium and dynamics. Games Econ. Behav. 71(1): 6-8 (2011) - 2010
- [j23]Sergiu Hart, Yishay Mansour:
How long to equilibrium? The communication complexity of uncoupled equilibrium procedures. Games Econ. Behav. 69(1): 107-126 (2010)
2000 – 2009
- 2009
- [j22]Sergiu Hart:
Proposals to host the Fourth World Congress of the Game Theory Society. Games Econ. Behav. 65(1): 287 (2009) - [j21]Sergiu Hart:
Proposals to host the Fourth World Congress of the Game Theory Society. Games Econ. Behav. 65(2): 649 (2009) - 2008
- [j20]Sergiu Hart:
Michael's questions. Games Econ. Behav. 64(2): 367 (2008) - [j19]Sergiu Hart:
Discrete Colonel Blotto and General Lotto games. Int. J. Game Theory 36(3-4): 441-460 (2008) - 2007
- [c8]Sergiu Hart, Yishay Mansour:
The communication complexity of uncoupled nash equilibrium procedures. STOC 2007: 345-353 - 2006
- [j18]Sergiu Hart, Andreu Mas-Colell:
Stochastic uncoupled dynamics and Nash equilibrium. Games Econ. Behav. 57(2): 286-303 (2006) - 2005
- [j17]Sergiu Hart:
An axiomatization of the consistent non-transferable utility value. Int. J. Game Theory 33(3): 355-366 (2005) - [c7]Sergiu Hart, Andreu Mas-Colell:
Stochastic uncoupled dynamics and nash equilibrium: extended abstract. TARK 2005: 52-61 - 2003
- [j16]Sergiu Hart, Andreu Mas-Colell:
Regret-based continuous-time dynamics. Games Econ. Behav. 45(2): 375-394 (2003) - 2002
- [j15]Sergiu Hart:
Evolutionary dynamics and backward induction. Games Econ. Behav. 41(2): 227-264 (2002) - 2001
- [j14]Sergiu Hart, Andreu Mas-Colell:
A General Class of Adaptive Strategies. J. Econ. Theory 98(1): 26-54 (2001)
1990 – 1999
- 1997
- [j13]Sergiu Hart, Dov Monderer:
Potentials and Weighted Values of Nonatomic Games. Math. Oper. Res. 22(3): 619-630 (1997) - 1996
- [c6]Robert J. Aumann, Sergiu Hart, Motty Perry:
The Absent-Minded Driver. TARK 1996: 97-116 - 1995
- [j12]Sergiu Hart, Andreu Mas-Colell:
Egalitarian Solutions of Large Games: I. A Continuum of Players. Math. Oper. Res. 20(4): 959-1002 (1995) - [j11]Sergiu Hart, Andreu Mas-Colell:
Egalitarian Solutions of Large Games: II. The Asymptotic Approach. Math. Oper. Res. 20(4): 1003-1022 (1995) - 1994
- [c5]Sergiu Hart:
On Prize Games. Essays in Game Theory 1994: 111-121
1980 – 1989
- 1989
- [j10]Sergiu Hart, David Schmeidler:
Existence of Correlated Equilibria. Math. Oper. Res. 14(1): 18-25 (1989) - 1986
- [j9]Sergiu Hart, Micha Sharir:
Nonlinearity of Davenport - Schinzel sequences and of generalized path compression schemes. Comb. 6(2): 151-178 (1986) - [j8]Sergiu Hart, Micha Sharir:
Probabilistic Propositional Temporal Logics. Inf. Control. 70(2/3): 97-155 (1986) - 1985
- [j7]Sergiu Hart:
Nonzero-Sum Two-Person Repeated Games with Incomplete Information. Math. Oper. Res. 10(1): 117-153 (1985) - [j6]Sergiu Hart, Micha Sharir:
Concurrent Probabilistic Programs, Or: How to Schedule if You Must. SIAM J. Comput. 14(4): 991-1012 (1985) - 1984
- [j5]Micha Sharir, Amir Pnueli, Sergiu Hart:
Verification of Probabilistic Programs. SIAM J. Comput. 13(2): 292-314 (1984) - [c4]Sergiu Hart, Micha Sharir:
Nonlinearity of Davenport-Schinzel Sequences and of a Generalized Path Compression Scheme. FOCS 1984: 313-319 - [c3]Sergiu Hart, Micha Sharir:
Probabilistic Temporal Logics for Finite and Bounded Models. STOC 1984: 1-13 - 1983
- [j4]Sergiu Hart, Micha Sharir, Amir Pnueli:
Termination of Probabilistic Concurrent Program. ACM Trans. Program. Lang. Syst. 5(3): 356-380 (1983) - [c2]Sergiu Hart, Micha Sharir:
Concurrent Probabilistic Program, or: How to Schedule if You Must. ICALP 1983: 304-318 - 1982
- [c1]Sergiu Hart, Micha Sharir, Amir Pnueli:
Termination of Probabilistic Concurrent Programs. POPL 1982: 1-6 - 1981
- [j3]Zvi Artstein, Sergiu Hart:
Law of Large Numbers for Random Sets and Allocation Processes. Math. Oper. Res. 6(4): 485-492 (1981) - 1980
- [j2]Sergiu Hart:
Measure-Based Values of Market Games. Math. Oper. Res. 5(2): 197-228 (1980)
1970 – 1979
- 1976
- [j1]Sergiu Hart:
A note on the edges of the n-cube. Discret. Math. 14(2): 157-163 (1976)
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 22:57 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:
