default search action
Rida Laraki
Person information
- affiliation: Paris Dauphine University, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Mourad Baïou, José Correa, Rida Laraki:
Mathematical Optimization for Fair Social Decisions: A Tribute to Michel Balinski. Math. Program. 203(1): 1-7 (2024) - [j21]Andrew B. Jennings, Rida Laraki, Clemens Puppe
, Estelle Marine Varloot:
New characterizations of strategy-proofness under single-peakedness. Math. Program. 203(1): 207-238 (2024) - [c12]Maxime Reynouard, Olga Gorelkina, Rida Laraki:
BAR Nash Equilibrium and Application to Blockchain Design. AAMAS 2024: 2435-2437 - [i18]Maxime Reynouard, Rida Laraki, Olga Gorelkina:
BAR Nash Equilibrium and Application to Blockchain Design. CoRR abs/2401.16856 (2024) - 2023
- [j20]Srihari Govindan, Rida Laraki
On sustainable equilibria. J. Econ. Theory 213: 105736 (2023) - [c11]Raphael Krief, Eric Benhamou, Beatrice Guez, Jean-Jacques Ohana, David Saltiel, Rida Laraki, Jamal Atif:
FSDA: Tackling Tail-Event Analysis in Imbalanced Time Series Data with Feature Selection and Data Augmentation. LIDTA 2023: 45-58 - [i17]Rida Laraki, Estelle Varloot:
Grading and Ranking Large number of candidates. CoRR abs/2302.12207 (2023) - [i16]Srihari Govindan, Rida Laraki, Lucas Pahl:
O'Neill's Theorem for Games. CoRR abs/2312.03392 (2023) - 2022
- [j19]Michel Balinski, Rida Laraki
Majority Judgment vs. Approval Voting. Oper. Res. 70(3): 1296-1316 (2022) - [c10]Felipe Garrido-Lucero, Rida Laraki:
Stable Matching Games. AAMAS 2022: 1595-1597 - [c9]Lucas Baudin, Rida Laraki:
Fictitious Play and Best-Response Dynamics in Identical Interest and Zero-Sum Stochastic Games. ICML 2022: 1664-1690 - [c8]Lucas Baudin, Rida Laraki:
Smooth Fictitious Play in Stochastic Games with Perturbed Payoffs and Unknown Transitions. NeurIPS 2022 - [c7]Geovani Rizk, Igor Colin, Albert Thomas, Rida Laraki, Yann Chevaleyre:
An $\alpha$-No-Regret Algorithm For Graphical Bilinear Bandits. NeurIPS 2022 - [c6]Estelle Marine Varloot, Rida Laraki:
Level-strategyproof Belief Aggregation Mechanisms. EC 2022: 335-369 - [i15]Geovani Rizk, Igor Colin, Albert Thomas, Rida Laraki, Yann Chevaleyre:
An α-No-Regret Algorithm For Graphical Bilinear Bandits. CoRR abs/2206.00466 (2022) - [i14]Lucas Baudin, Rida Laraki:
Smooth Fictitious Play in Stochastic Games with Perturbed Payoffs and Unknown Transitions. CoRR abs/2207.03109 (2022) - 2021
- [c5]Geovani Rizk, Albert Thomas, Igor Colin, Rida Laraki, Yann Chevaleyre:
Best Arm Identification in Graphical Bilinear Bandits. ICML 2021: 9010-9019 - [i13]Andrew B. Jennings, Rida Laraki, Clemens Puppe, Estelle Varloot:
New Characterizations of Strategy-Proofness under Single-Peakedness. CoRR abs/2102.11686 (2021) - [i12]Saeed Hadikhanloo, Rida Laraki, Panayotis Mertikopoulos
Learning in nonatomic games, Part I: Finite action spaces and population games. CoRR abs/2107.01595 (2021) - [i11]Felipe Garrido-Lucero, Rida Laraki:
EPTAS for stable allocations in matching games. CoRR abs/2107.07440 (2021) - [i10]Rida Laraki, Estelle Varloot:
Level-strategyproof Belief Aggregation Mechanisms. CoRR abs/2108.04705 (2021) - 2020
- [j18]Rida Laraki
Acyclic Gambling Games. Math. Oper. Res. 45(4): 1237-1257 (2020) - [j17]Michel Balinski, Rida Laraki
Majority judgment vs. majority rule. Soc. Choice Welf. 54(2-3): 429-461 (2020) - [c4]David Saltiel, Eric Benhamou, Rida Laraki, Jamal Atif:
Trade Selection with Supervised Learning and Optimal Coordinate Ascent (OCA). MIDAS@PKDD/ECML 2020: 1-15 - [c3]Eric Benhamou, David Saltiel, Jean-Jacques Ohana, Jamal Atif, Rida Laraki:
Deep Reinforcement Learning (DRL) for Portfolio Allocation. ECML/PKDD (5) 2020: 527-531 - [c2]Srihari Govindan, Rida Laraki, Lucas Pahl:
On Sustainable Equilibria. EC 2020: 767-768 - [i9]Felipe Garrido-Lucero, Rida Laraki:
Stable Matching Games. CoRR abs/2008.01680 (2020) - [i8]Geovani Rizk, Albert Thomas, Igor Colin, Rida Laraki, Yann Chevaleyre:
Best Arm Identification in Graphical Bilinear Bandits. CoRR abs/2012.07641 (2020)
2010 – 2019
- 2019
- [i7]Eric Benhamou
NGO-GM: Natural Gradient Optimization for Graphical Models. CoRR abs/1905.05444 (2019) - 2018
- [j16]János Flesch, Rida Laraki
Approachability of convex sets in generalized quitting games. Games Econ. Behav. 108: 411-431 (2018) - [i6]Eric Benhamou, Jamal Atif, Rida Laraki, Anne Auger:
A new approach to learning in Dynamic Bayesian Networks (DBNs). CoRR abs/1812.09027 (2018) - [i5]Eric Benhamou
A discrete version of CMA-ES. CoRR abs/1812.11859 (2018) - 2017
- [j15]Rida Laraki
A continuity question of Dubins and Savage. J. Appl. Probab. 54(2): 462-473 (2017) - 2016
- [c1]János Flesch, Rida Laraki, Vianney Perchet:
Online Learning and Blackwell Approachability in Quitting Games. COLT 2016: 941-942 - [i4]János Flesch, Rida Laraki, Vianney Perchet:
Approachability of convex sets in generalized quitting games. CoRR abs/1609.08870 (2016) - 2015
- [j14]Rida Laraki
Inertial Game Dynamics and Applications to Constrained Optimization. SIAM J. Control. Optim. 53(5): 3141-3170 (2015) - 2014
- [j13]Michel Balinski, Rida Laraki
Judge: Don't Vote! Oper. Res. 62(3): 483-511 (2014) - 2013
- [j12]Rida Laraki
Two-Person Zero-Sum Stochastic Games with Semicontinuous Payoff. Dyn. Games Appl. 3(2): 162-171 (2013) - [j11]Rida Laraki
Higher order game dynamics. J. Econ. Theory 148(6): 2666-2695 (2013) - [i3]Rida Laraki, Panayotis Mertikopoulos:
Inertial game dynamics and applications to constrained optimization. CoRR abs/1305.0967 (2013) - 2012
- [j10]Rida Laraki
Semidefinite programming for min-max problems and games. Math. Program. 131(1-2): 305-332 (2012) - [j9]Pierre Cardaliaguet, Rida Laraki
A Continuous Time Approach for the Asymptotic Value in Two-Person Zero-Sum Repeated Games. SIAM J. Control. Optim. 50(3): 1573-1596 (2012) - [i2]Rida Laraki, Panayotis Mertikopoulos:
Higher Order Game Dynamics. CoRR abs/1206.4181 (2012) - 2010
- [j8]Rida Laraki
Explicit formulas for repeated games with absorbing states. Int. J. Game Theory 39(1-2): 53-69 (2010)
2000 – 2009
- 2009
- [j7]Michel Balinski, Rida Laraki, Sylvain Sorin:
David Gale in Paris. Games Econ. Behav. 66(2): 594-597 (2009) - [j6]Olivier Gossner, Rida Laraki
Informationally optimal correlation. Math. Program. 116(1-2): 147-172 (2009) - 2008
- [i1]Rida Laraki, Jean B. Lasserre:
Semidefinite programming for N-Player Games. CoRR abs/0810.3150 (2008) - 2005
- [j5]Rida Laraki
Continuous-time games of timing. J. Econ. Theory 120(2): 206-238 (2005) - [j4]Rida Laraki
The Value of Zero-Sum Stopping Games in Continuous Time. SIAM J. Control. Optim. 43(5): 1913-1922 (2005) - 2004
- [j3]Rida Laraki
The Preservation of Continuity and Lipschitz Continuity by Optimal Reward Operators. Math. Oper. Res. 29(3): 672-685 (2004) - 2002
- [j2]Rida Laraki
The splitting game and applications. Int. J. Game Theory 30(3): 359-376 (2002) - 2001
- [j1]Rida Laraki:
Variational Inequalities, System of Functional Equations, and Incomplete Information Repeated Games. SIAM J. Control. Optim. 40(2): 516-524 (2001)
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-10-07 21:25 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: